10997 search results - page 2054 / 2200 » On the Structure of Complete Sets |
174
click to vote
WLP
1997
Springer
15 years 10 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
187
click to vote
LATA
2010
Springer
15 years 10 months ago
2010
Springer
Automated reasoning about systems with infinite domains requires an extension of regular automata to infinite alphabets. Existing formalisms of such automata cope with the infinite...
196
click to vote
CPM
1993
Springer
15 years 10 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
163
click to vote
DBVIS
1993
15 years 10 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
157
click to vote
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...