Publications

Search or filter publications

Filter by type:

Filter by publication type

Filter by year:

to

Results

  • Showing results for:
  • Reset all filters

Search results

  • Conference paper
    Yang Q, Barria JA, Hernandez Aramburo C, 2009,

    Communication infrastructures to facilitate regional voltage control of active radial distribution network

    , 52nd IEEE Midwest Symposium on Circuits and Systems (MWSCAS2009), Publisher: IEEE, Pages: 284-287
  • Conference paper
    Yang Q, Barria JA, Hernandez Aramburo C, 2009,

    A communication system for regional control of power distribution networks

    , 7th IEEE International Conference on Industrial Informatics (INDIN20097th IEEE International Conference on Industrial Informatics (INDIN2009), Publisher: IEEE, Pages: 372-377
  • Journal article
    Regner T, Barria JA, 2009,

    Do Consumers Pay Voluntarily? The Case of Online Music

    , Journal of Economic Behavior and Organization, Vol: 71, Pages: 395-406, ISSN: 0167-2681
  • Journal article
    Kim T-K, Cipolla R, 2009,

    Canonical Correlation Analysis of Video Volume Tensors for Action Categorization and Detection

    , IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol: 31, Pages: 1415-1428
  • Journal article
    Alarcon-Aquino V, Barria JA, 2009,

    Change Detection in Time Series using The Maximal Overlap Discrete Wavelet Transform

    , Latin American Arbitration Review, Vol: 39, Pages: 145-152, ISSN: 0327-0793
  • Journal article
    Zachariadis G, Barria JA, 2008,

    Dynamic pricing and resource allocation using revenue management for multiservice networks

    , IEEE Transactions on Network and Service Management, Vol: 5, Pages: 215-226, ISSN: 1932-4537

    In this paper we develop a novel multiple-classes-ofservice framework where offered prices and QoS are allowed to be actively modified by the provider, depending on the demand and the congestion of the system. We obtain a solution to the problem by using dynamic programming. These results are then extended to a network environment using a decomposition approach. The decomposition approach makes our solution scalable, since single-link solutions are used and minimal amount of information is explicitly exchanged. Assessments carried out for small networks show that the obtained income is improved between 2%-20% when compared to a static approach and to other approaches where only price or quality are allowed to be adaptive.
  • Patent
    Kim T, 2008,

    Method and system for face detection using pattern classifier

    , US7447338
  • Journal article
    Lopez B, Innocenti B, Busquets D, 2008,

    A multiagent system for coordinating ambulances for Emergency Medical Services

    , IEEE INTELLIGENT SYSTEMS, Vol: 23, Pages: 50-57, ISSN: 1541-1672
  • Patent
    Hwang W, Kamei T, Kee S, Kim H, Kim Tet al., 2008,

    Method and apparatus for extracting feature vector used for face recognition and retrieval

    , US7391889
  • Patent
    Kim T, Lee J, 2008,

    System and method for detecting and tracking a plurality of faces in real time by integrating visual ques

    , US7352880
  • Conference paper
    Li Z, Barria J, Lent R, 2008,

    Evaluation of A WSN Assisted MANET Routing Algorithm

    , Proc. of the IET Target Tracking and Data Fusion Seminar: Algorithms & Applications
  • Patent
    Cho I, Kim T, Lee J, 2008,

    Illumination-invariant object tracking method and image editing system using the same

    , US7346189
  • Journal article
    Salles RM, Barria JA, 2008,

    Lexicographic maximin optimisation for fair bandwidth allocation in computer networks

    , EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, Vol: 185, Pages: 778-794, ISSN: 0377-2217
  • Conference paper
    Munoz V, Busquets D, 2008,

    Managing Risk in Recurrent Auctions for Robust Resource Allocation

    , 4th Starting Artificial Intelligence Researchers Symposium, Publisher: IOS PRESS, Pages: 140-150, ISSN: 0922-6389
  • Conference paper
    Munoz V, Busquets D, 2008,

    Robustness in Recurrent Auctions for Resource Allocation

    , 11th International Conference of the Catalan-Association-for-Artificial-Intelligence, Publisher: IOS PRESS, Pages: 70-+, ISSN: 0922-6389
  • Conference paper
    Stenger B, Woodley T, Kim T-K, Hernandez C, Cipolla Ret al., 2008,

    AIDIA - Adaptive Interface for Display InterAction

    , British Machine Vision Conference
  • Conference paper
    Kim T-K, Cipolla R, 2008,

    MCBoost: Multiple Classifier Boosting for Perceptual Co-clustering of Images and Visual Features

    , In Advances in Neural Information Processing Systems, Pages: 841-856
  • Conference paper
    Murillo J, Munoz V, Lopez B, Busquets Det al., 2008,

    A Fair Mechanism for Recurrent Multi-unit Auctions

    , 6th German Conference on Multiagent System Technologies, Publisher: SPRINGER-VERLAG BERLIN, Pages: 147-158, ISSN: 0302-9743
  • Journal article
    Gunduz D, Erkip E, 2008,

    Joint Source-Channel Codes for MIMO Block Fading Channels

    , IEEE Transactions Information Theory, Vol: 54, Pages: 116-134, ISSN: 0018-9448

    We consider transmission of a continuous amplitude source over an L-blockRayleigh fading $M_t \times M_r$ MIMO channel when the channel stateinformation is only available at the receiver. Since the channel is notergodic, Shannon's source-channel separation theorem becomes obsolete and theoptimal performance requires a joint source -channel approach. Our goal is tominimize the expected end-to-end distortion, particularly in the high SNRregime. The figure of merit is the distortion exponent, defined as theexponential decay rate of the expected distortion with increasing SNR. Weprovide an upper bound and lower bounds for the distortion exponent withrespect to the bandwidth ratio among the channel and source bandwidths. For thelower bounds, we analyze three different strategies based on layered sourcecoding concatenated with progressive, superposition or hybrid digital/analogtransmission. In each case, by adjusting the system parameters we optimize thedistortion exponent as a function of the bandwidth ratio. We prove that thedistortion exponent upper bound can be achieved when the channel has only onedegree of freedom, that is L=1, and $\min\{M_t,M_r\}=1$. When we have moredegrees of freedom, our achievable distortion exponents meet the upper boundfor only certain ranges of the bandwidth ratio. We demonstrate that ourresults, which were derived for a complex Gaussian source, can be extended tomore general source distributions as well.
  • Journal article
    Guenduez D, Erkip E, 2007,

    Source and channel coding for cooperative relaying

    , IEEE TRANSACTIONS ON INFORMATION THEORY, Vol: 53, Pages: 3454-3475, ISSN: 0018-9448
  • Conference paper
    Zachariadis G, Barria JA, 2007,

    Load distribution for telecommunications networks using revenue management

    , Pages: 325-330
  • Journal article
    Ghanea-Hercock R, Gelenbe E, Jennings NR, Smith O, Allsopp DN, Healing A, Duman H, Sparks S, Karunatillake NC, Vytelingum Pet al., 2007,

    Hyperion - Next-Generation Battlespace Information Services

    , Computer Journal, Vol: 50, Pages: 632-645, ISSN: 1460-2067

    The future digital battlespace will be a fast-paced and frenetic environment that stresses information communication technology systems to the limit. The challenges are most acute in the tactical and operational domains where bandwidth is severely limited, security of information is paramount, the network is under physical and cyber attack and administrative support is minimal. Hyperion is a cluster of research projects designed to provide an automated and adaptive information management capability embedded in defence networks. The overall system architecture is designed to improve the situational awareness of field commanders by providing the ability to fuse and compose information services in real time. The key technologies adopted to enable this include: autonomous software agents, self-organizing middleware, a smart data filtering system and a 3-D battlespace simulation environment. This paper reviews some of the specific techniques under development within the Hyperion sub-projects and the results achieved to date.
  • Journal article
    Shutoy HY, Guenduez D, Erkip E, Wang Yet al., 2007,

    Cooperative Source and Channel Coding for Wireless Multimedia Communications

    , IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, Vol: 1, Pages: 295-307, ISSN: 1932-4553
  • Journal article
    Zachariadis G, Barria J, 2007,

    Demand management for telecommunications services

    , Computer Networks, Vol: 51, Pages: 3507-3524, ISSN: 1389-1286
  • Journal article
    Mayer D, Barria J A, 2007,

    Bandwidth Allocation for a Revenue-Aware Network Utility Maximisation

    , IEEE Communications Letters, Vol: 11
  • Conference paper
    Zachariadis G, Barria JA, 2007,

    Dynamic Revenue Management for Flows in Packet Networks

    , Pages: 2076-2081
  • Journal article
    Usaha W, Barria J A, 2007,

    Reinforcement learning for resource allocation in LEO satellite networks

    , IEEE Transactions on Systems, Man, and Cybernetics – B, Vol: 37, Pages: 515-527, ISSN: 1083-4419
  • Conference paper
    Giaffreda R, Barria JA, 2007,

    Service Delivery in Collaborative Contex-aware environments using Fuzzy Logic

    , Pages: 2045-2049
  • Journal article
    Michalowski MP, Sabanovic S, DiSalvo C, Busquets D, Hiatt LM, Melchior NA, Simmons Ret al., 2007,

    Socially distributed perception: GRACE plays social tag at AAAI 2005

    , AUTONOMOUS ROBOTS, Vol: 22, Pages: 385-397, ISSN: 0929-5593
  • Journal article
    Gündüz D, Erkip E, 2007,

    Opportunistic cooperation by dynamic resource allocation

    , IEEE Transactions on Wireless Communications, Vol: 6, Pages: 1446-1454, ISSN: 1536-1276

    We consider a Rayleigh fading wireless relay channel where communication is constrained by delay and average power limitations. Assuming partial channel state information at the transmitters and perfect channel state information at the receivers, we first study the delay-limited capacity of this system and show that, contrary to a single source-single destination case, a non-zero delay-limited capacity is achievable. We introduce opportunistic decode-and-forward (ODF) protocol which utilizes the relay depending on the channel state. Opportunistic cooperation significantly improves the delay-limited capacity of the system and performs very close to the cut-set bound. We also consider the system performance in terms of minimum outage probability. We show that ODF provides performance close to the cut-set bound from the outage probability perspective as well. Our results emphasize the importance of feedback for cooperative systems that have delay sensitive applications. © 2007 IEEE.

This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.

Request URL: http://www.imperial.ac.uk:80/respub/WEB-INF/jsp/search-t4-html.jsp Request URI: /respub/WEB-INF/jsp/search-t4-html.jsp Query String: id=405&limit=30&page=5&respub-action=search.html Current Millis: 1685262687027 Current Time: Sun May 28 09:31:27 BST 2023