688 search results - page 104 / 138 » General Partitioning on Random Graphs |
95
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— We analyze the susceptibility of the Internet to random faults, malicious attacks, and mixtures of faults and attacks. We analyze actual Internet data, as well as simulated dat...
112
click to vote
STOC
2003
ACM
16 years 23 days ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
119
Voted
ICDE
2010
IEEE
16 years 6 days ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
77
Voted
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
Record deduplication is the task of merging database records that refer to the same underlying entity. In relational databases, accurate deduplication for records of one type is o...
120
Voted
EWCBR
2006
Springer
15 years 4 months ago
2006
Springer
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain)...