7167 search results - page 515 / 1434 » Answer Set Programming |
155
click to vote
COMPGEOM
1997
ACM
15 years 8 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
140
click to vote
KDD
1994
ACM
15 years 8 months ago
1994
ACM
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn required semantic rules has no...
141
click to vote
STOC
1993
ACM
15 years 8 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
142
Voted
VLDB
1990
ACM
15 years 8 months ago
1990
ACM
A probabilistic learning model for vague queries and missing or imprecise information in databases is described. Instead of retrieving only a set of answers, our approach yields a...
148
Voted
ANTS
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...