3758 search results - page 104 / 752 » A Complete Subsumption Algorithm |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
CIS
2004
Springer
15 years 3 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
CATS
2006
14 years 11 months ago
2006
A complete description and proof of correctness are given for a new polynomial time algorithm for a class of codes based on directed graphs and involving construction well known i...