Sciweavers

425 search results - page 24 / 85
» Polynomial Time Data Reduction for Dominating Set
Sort
View
NIPS
2008
14 years 11 months ago
Measures of Clustering Quality: A Working Set of Axioms for Clustering
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
Shai Ben-David, Margareta Ackerman
CPM
2007
Springer
101views Combinatorics» more  CPM 2007»
15 years 3 months ago
Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
Abstract. Detecting historical recombination is an important computational problem which has received great attention recently. Due to recombination, input sequences form a mosaic,...
Yufeng Wu, Dan Gusfield
ADHOCNOW
2008
Springer
15 years 3 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
EDBT
2011
ACM
231views Database» more  EDBT 2011»
14 years 29 days ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
CIKM
2009
Springer
15 years 4 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer