466 search results - page 28 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
76
Voted
ENTCS
2008
14 years 12 months ago
2008
Traditional methods for combining theory solvers rely on capabilities of the solvers to produce all implied equalities or a pre-processing step that introduces additional literals...
113
click to vote
4OR
2010
14 years 10 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
130
click to vote
TKDE
2011
14 years 6 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
175
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...