Sciweavers

16404 search results - page 2561 / 3281
» A set coverage problem
Sort
View
ICDCS
2006
IEEE
16 years 1 months ago
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ICDCS
2006
IEEE
16 years 1 months ago
A Hierarchical Approach to Internet Distance Prediction
Internet distance prediction gives pair-wise latency information with limited measurements. Recent studies have revealed that the quality of existing prediction mechanisms from th...
Rongmei Zhang, Y. Charlie Hu, Xiaojun Lin, Sonia F...
ICDE
2006
IEEE
143views Database» more  ICDE 2006»
16 years 1 months ago
Effectiveness Bounds for Non-Exhaustive Schema Matching Systems
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
16 years 1 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
« Prev « First page 2561 / 3281 Last » Next »