Sciweavers

4698 search results - page 392 / 940
» Making Functionality More General
Sort
View
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
16 years 2 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
MOBIHOC
2003
ACM
16 years 4 months ago
Mobility helps security in ad hoc networks
Contrary to the common belief that mobility makes security more difficult to achieve, we show that node mobility can, in fact, be useful to provide security in ad hoc networks. We...
Jean-Pierre Hubaux, Levente Buttyán, Srdjan...
ATAL
2009
Springer
15 years 11 months ago
Distributed constraint optimization with structured resource constraints
Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on age...
Akshat Kumar, Boi Faltings, Adrian Petcu
SDM
2011
SIAM
232views Data Mining» more  SDM 2011»
14 years 7 months ago
A Sequential Dual Method for Structural SVMs
In many real world prediction problems the output is a structured object like a sequence or a tree or a graph. Such problems range from natural language processing to computationa...
Shirish Krishnaj Shevade, Balamurugan P., S. Sunda...
COMPGEOM
2004
ACM
15 years 10 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...