Sciweavers

664 search results - page 39 / 133
» Solution to the Counterfeit Coin Problem and its Generalizat...
Sort
View
INFOCOM
2009
IEEE
15 years 4 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 ...
INFOCOM
2009
IEEE
15 years 4 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
BIOWIRE
2007
Springer
15 years 4 months ago
A Circulatory System Approach for Wireless Sensor Networks
Abstract—One of the challenges in a military wireless sensor network is the determination of an information collection infrastructure which minimizes battery power consumption. T...
Vasileios Pappas, Dinesh Verma, Ananthram Swami
TALG
2008
97views more  TALG 2008»
14 years 9 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
ECML
2006
Springer
15 years 1 months ago
The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces
Minimum volume covering ellipsoid estimation is important in areas such as systems identification, control, video tracking, sensor management, and novelty detection. It is well kno...
Alexander N. Dolia, Tijl De Bie, Christopher J. Ha...