Sciweavers

5316 search results - page 895 / 1064
» Which Search Problems Are Random
Sort
View
SAT
2009
Springer
117views Hardware» more  SAT 2009»
15 years 11 months ago
Dynamic Symmetry Breaking by Simulating Zykov Contraction
Abstract. We present a new method to break symmetry in graph coloring problems. While most alternative techniques add symmetry breaking predicates in a pre-processing step, we deve...
Bas Schaafsma, Marijn Heule, Hans van Maaren
SEAL
1998
Springer
15 years 8 months ago
Automating Space Allocation in Higher Education
The allocation of office space in any large institution is usually a problematical issue, which often demands a substantial amount of time to perform manually. The result of this a...
Edmund K. Burke, D. B. Varley
CVPR
2009
IEEE
16 years 11 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...
KDD
2005
ACM
182views Data Mining» more  KDD 2005»
16 years 4 months ago
Making holistic schema matching robust: an ensemble approach
The Web has been rapidly "deepened" by myriad searchable databases online, where data are hidden behind query interfaces. As an essential task toward integrating these m...
Bin He, Kevin Chen-Chuan Chang
DASFAA
2007
IEEE
221views Database» more  DASFAA 2007»
15 years 10 months ago
TwigList : Make Twig Pattern Matching Fast
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...
Lu Qin, Jeffrey Xu Yu, Bolin Ding