1039 search results - page 106 / 208 » Query reformulation with constraints |
136
click to vote
BNCOD
2004
15 years 6 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
170
click to vote
KRDB
1996
15 years 6 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
147
Voted
DKE
2007
15 years 5 months ago
2007
We introduce parameterized pattern queries as a new paradigm to extend traditional pattern expressions over sequence databases. A parameterized pattern is essentially a string mad...
162
click to vote
APLAS
2011
ACM
14 years 5 months ago
2011
ACM
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
149
Voted
CP
2003
Springer
15 years 10 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...