2526 search results - page 134 / 506 » A New Algorithm for Answer Set Computation |
175
click to vote
ICCS
2005
Springer
15 years 11 months ago
2005
Springer
Phylogenetic networks model evolutionary histories in the presence of non-treelike events such as hybrid speciation and horizontal gene transfer. In spite of their widely acknowled...
141
click to vote
ICDT
1995
ACM
15 years 9 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...
157
click to vote
CIARP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we introduce a general framework for hierarchical clustering that deals with both static and dynamic data sets. From this framework, different hierarchical...
291
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
142
click to vote
VLDB
1997
ACM
15 years 10 months ago
1997
ACM
The cpquantile of an ordered sequenceof data values is the element with rank ‘pn, where n is the total number of values. Accurate estimates of quantiles are required for the sol...