Sciweavers

2181 search results - page 64 / 437
» The restriction scaffold problem
Sort
View
JAIR
1998
92views more  JAIR 1998»
13 years 8 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson
ICCBR
1999
Springer
14 years 1 months ago
Flexibly Interleaving Processes
We discuss several problems of analogy-driven proof plan construction which prevent a solution for more diæcult target problems or make a solution very expensive. Some of these pr...
Erica Melis, Carsten Ullrich
CADE
2009
Springer
14 years 3 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer
SIGMOD
2007
ACM
183views Database» more  SIGMOD 2007»
14 years 8 months ago
Leveraging aggregate constraints for deduplication
We show that aggregate constraints (as opposed to pairwise constraints) that often arise when integrating multiple sources of data, can be leveraged to enhance the quality of dedu...
Surajit Chaudhuri, Anish Das Sarma, Venkatesh Gant...
ICIAR
2004
Springer
14 years 2 months ago
Reliable Dual-Band Based Contour Detection: A Double Dynamic Programming Approach
Finding contours in constrained search space is a well known problem. It is encountered in such areas as tracking objects in videos, or finding objects within defined boundaries....
Mohammad Dawood, Xiaoyi Jiang, Klaus P. Schäf...