Sciweavers

867 search results - page 70 / 174
» The Generalized Maximum Coverage Problem
Sort
View
IPL
2006
99views more  IPL 2006»
13 years 8 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
COMPSAC
2004
IEEE
13 years 11 months ago
Excalibur: A Personalized Meta Search Engine
General purpose Web search engines are becoming ineffective due to the rapid growth and changes in the contents of the World Wide Web. Meta-search engines help a bit by having a b...
Leo Yuen, Matthew Chang, Ying Kit Lai, Chung Keung...
RECOMB
1997
Springer
14 years 6 days ago
A branch-and-cut algorithm for multiple sequence alignment
Multiple sequence alignment is an important problem in computational biology. We study the Maximum Trace formulation introduced by Kececioglu [?]. We first phrase the problem in ...
Knut Reinert, Hans-Peter Lenhof, Petra Mutzel, Kur...
FSTTCS
2010
Springer
13 years 6 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 2 months ago
Multiplicative synopses for relative-error metrics
Existing hierarchical summarization techniques fail to provide synopses good in terms of relative-error metrics. This paper introduces multiplicative synopses: a summarization par...
Panagiotis Karras