12 search results - page 2 / 3 » Improving Exhaustive Search Implies Superpolynomial Lower Bo... |
CP
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
DEXA
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. The object-oriented database management systems store references to objects (implicit joins, precomputed joins), and use path expressions in query languages. One way of e...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
CAMP
2005
IEEE
14 years 1 months ago
2005
IEEE
— This paper describes the mapping of a recently introduced template matching algorithm based on the Normalized Cross Correlation (NCC) on a general purpose processor endowed wit...