3333 search results - page 578 / 667 » Abstract Proof Search |
172
click to vote
ISVC
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
139
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Computing lower bounds to the best-cost extension of a tuple is an ubiquous task in constraint optimization. A particular case of special interest is the computation of l...
161
click to vote
CP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
139
click to vote
ECML
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. This paper presents a simple unsupervised learning algorithm for recognizing synonyms, based on statistical data acquired by querying a Web search engine. The algorithm, ...
145
click to vote
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...