5169 search results - page 121 / 1034 » Locality approximation using time |
135
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
147
Voted
ATAL
2010
Springer
15 years 6 months ago
2010
Springer
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
180
click to vote
AAAI
2007
15 years 7 months ago
2007
In this paper, we consider a hybrid solution to the sensor network position inference problem, which combines a real-time filtering system with information from a more expensive,...
196
click to vote
PODC
2012
ACM
13 years 7 months ago
2012
ACM
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
140
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— Until recently, the problem of localization in wireless networks has been mainly studied in a non-adversarial setting. Only recently, a number of solutions have been proposed t...