Sciweavers

2137 search results - page 358 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Towards Optimal Resource Allocation in Partial-Fault Tolerant Applications
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...
Nikhil Bansal, Ranjita Bhagwan, Navendu Jain, Yoon...
PVLDB
2010
82views more  PVLDB 2010»
13 years 6 months ago
Record Linkage with Uniqueness Constraints and Erroneous Values
Many data-management applications require integrating data from a variety of sources, where different sources may refer to the same real-world entity in different ways and some ma...
Songtao Guo, Xin Dong, Divesh Srivastava, Remi Zaj...
DKE
2008
79views more  DKE 2008»
13 years 7 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis
WWW
2008
ACM
14 years 8 months ago
Query-sets: using implicit feedback and query patterns to organize web documents
In this paper we present a new document representation model based on implicit user feedback obtained from search engine queries. The main objective of this model is to achieve be...
Barbara Poblete, Ricardo A. Baeza-Yates
EUPROJECTS
2006
Springer
13 years 11 months ago
Web Mediators for Accessible Browsing
We present a highly accurate method for classifying web pages based on link percentage, which is the percentage of text characters that are parts of links normalized by the number...
Benjamin N. Waber, John J. Magee, Margrit Betke