466 search results - page 92 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
EDBT
2010
ACM
14 years 24 days ago
2010
ACM
This paper addresses a fundamental and challenging problem with broad applications: efficient processing of region-based promotion queries, i.e., to discover the top-k most inter...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
FMCAD
2000
Springer
13 years 9 months ago
2000
Springer
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
CPM
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...