728 search results - page 46 / 146 » Efficient Searching with Linear Constraints |
139
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
167
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
155
click to vote
JMM2
2007
15 years 6 months ago
2007
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
141
click to vote
CORR
1998
Springer
15 years 5 months ago
1998
Springer
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
157
click to vote
CPAIOR
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present a constraint programming approach for the service consolidation problem that is being currently tackled by Neptuny, Milan. The problem is defined as: Giv...