Sciweavers

3320 search results - page 472 / 664
» Heuristics for the Phylogeny Problem
Sort
View
ICDM
2009
IEEE
132views Data Mining» more  ICDM 2009»
16 years 27 days ago
Bayesian Overlapping Subspace Clustering
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
Qiang Fu, Arindam Banerjee
INFOCOM
2009
IEEE
16 years 26 days ago
Using Failure Models for Controlling Data Availability in Wireless Sensor Networks
— This paper presents Pirrus, a replica management system that addresses the problem of providing data availability on a wireless sensor network. Pirrus uses probabilistic failur...
Riccardo Crepaldi, Mirko Montanari, Indranil Gupta...
WEBI
2009
Springer
16 years 25 days ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
CIKM
2009
Springer
16 years 24 days ago
Graph-based seed selection for web-scale crawlers
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
16 years 24 days ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini