Sciweavers

4843 search results - page 627 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View

Publication
210views
15 years 11 months ago
Optimal Feature Selection for Subspace Image Matching
Image matching has been a central research topic in computer vision over the last decades. Typical approaches to correspondence involve matching features between images. In this pa...
Gemma Roig, Xavier Boix, Fernando De la Torre
ICFCA
2009
Springer
15 years 11 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
GLOBECOM
2009
IEEE
15 years 11 months ago
Anonymous Cardinality Estimation in RFID Systems with Multiple Readers
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
Vahid Shah-Mansouri, Vincent W. S. Wong
GLOBECOM
2009
IEEE
15 years 11 months ago
A Suboptimal Network Utility Maximization Approach for Scalable Multimedia Applications
—Wired and wireless data networks have witnessed an explosive growth of inelastic traffics such as real-time or media streaming applications. Recently, applications relying on l...
Mohammad Sadegh Talebi, Ahmad Khonsari, Mohammad H...
INFOCOM
2009
IEEE
15 years 11 months ago
Network Bandwidth Allocation via Distributed Auctions with Time Reservations
—This paper studies the problem of allocating network capacity through periodic auctions. Motivated primarily by a service overlay architecture, we impose the following condition...
Pablo Belzarena, Andrés Ferragut, Fernando ...