1046 search results - page 98 / 210 » Approximation Algorithms for Domination Search |
125
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
137
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
135
click to vote
SSDBM
2010
IEEE
15 years 28 days ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
149
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
141
click to vote
AAAI
1998
15 years 4 months ago
1998
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...