6365 search results - page 802 / 1273 » Fast Local Computation Algorithms |
202
click to vote
COLT
2004
Springer
16 years 1 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
216
click to vote
KBSE
1999
IEEE
15 years 12 months ago
1999
IEEE
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
188
click to vote
GECCO
2006
Springer
15 years 11 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
241
click to vote
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
17 years 2 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
172
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
In this paper, we address the problem of detecting pedestrians in still images. We introduce an algorithm for learning shapelet features, a set of mid?level features. These featur...