Sciweavers

217 search results - page 40 / 44
» Approximating Minimum Manhattan Networks
Sort
View
INFOCOM
1998
IEEE
14 years 2 months ago
Routing Lookups in Hardware at Memory Access Speeds
Increased bandwidth in the Internet puts great demands on network routers; for example, to route minimum sized Gigabit Ethernet packets, an IP router must process about packets pe...
Pankaj Gupta, Steven Lin, Nick McKeown
COMPGEOM
2001
ACM
14 years 1 months ago
Discrete mobile centers
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ICASSP
2010
IEEE
13 years 10 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
MONET
2008
135views more  MONET 2008»
13 years 9 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng
TEC
2008
135views more  TEC 2008»
13 years 9 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe