2107 search results - page 325 / 422 » Computing Small Search Numbers in Linear Time |
141
click to vote
ATAL
2007
Springer
16 years 14 days ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
166
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
180
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper revisits the classical problem of detecting interest points, popularly known as "corners," in 2D images by proposing a technique based on fitting algebraic sh...
247
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
179
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...