705 search results - page 80 / 141 » New Compilation Languages Based on Structured Decomposabilit... |
DAWAK
2001
Springer
15 years 2 months ago
2001
Springer
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
102
click to vote
NIPS
2008
14 years 11 months ago
2008
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
DISOPT
2008
14 years 10 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
IJCAI
2001
14 years 11 months ago
2001
We present an extensive experimental study of consequence-finding algorithms based on kernel resolution, using both a trie-based and a novel ZBDD-based implementation, which uses ...
AAAI
2000
14 years 11 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...