Sciweavers

11565 search results - page 2067 / 2313
» Computing Minimal Mappings
Sort
View
FOCS
2005
IEEE
16 years 7 days ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
ICCV
2005
IEEE
16 years 7 days ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
193
Voted
INFOCOM
2005
IEEE
16 years 6 days ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
MSWIM
2005
ACM
16 years 5 days ago
Fast pre-authentication based on proactive key distribution for 802.11 infrastructure networks
Recently, user mobility in wireless data networks is increasing because of the popularity of portable devices and the desire for voice and multimedia applications. These applicati...
Mohamed Kassab, Abdelfattah Belghith, Jean-Marie B...
PODC
2005
ACM
16 years 5 days ago
Stochastic analysis of distributed deadlock scheduling
Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling. An excessive initiation of ...
Shigang Chen, Yibei Ling
« Prev « First page 2067 / 2313 Last » Next »