6365 search results - page 298 / 1273 » Fast Local Computation Algorithms |
195
click to vote
CG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
186
click to vote
SIGECOM
2003
ACM
15 years 12 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
173
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
158
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
138
click to vote
ISCAS
2007
IEEE
16 years 29 days ago
2007
IEEE
—Fast sensory-motor processing is challenging when using traditional frame-based cameras and computers. Here we show how a hybrid neuromorphic-procedural system consisting of an ...