Sciweavers

46 search results - page 6 / 10
» Convex relaxation approach to the identification of the Wien...
Sort
View
ATMOS
2010
163views Optimization» more  ATMOS 2010»
13 years 6 months ago
Railway Track Allocation by Rapid Branching
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
Ralf Borndörfer, Thomas Schlechte, Steffen We...

Publication
433views
14 years 4 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 for correspondence involve matching features between images. In this p...
Gemma Roig, Xavier Boix, Fernando De la Torre
INFOCOM
2009
IEEE
14 years 2 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 ...
ICASSP
2011
IEEE
12 years 11 months ago
Directions-of-arrival estimation using a sparse spatial spectrum model with uncertainty
This paper is concerned with the estimation of the directionsof-arrival (DOA) of narrowband sources using a sparse spatial spectral model, when the model itself is not precise. Wh...
Jimeng Zheng, Mostafa Kaveh
DATE
2010
IEEE
129views Hardware» more  DATE 2010»
14 years 24 days ago
A power optimization method for CMOS Op-Amps using sub-space based geometric programming
—— A new sub-space max-monomial modeling scheme for CMOS transistors in sub-micron technologies is proposed to improve the modeling accuracy. Major electrical parameters of CMOS...
Wei Gao, Richard Hornsey