Sciweavers

1095 search results - page 189 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
ICS
2011
Tsinghua U.
14 years 7 months ago
High performance linpack benchmark: a fault tolerant implementation without checkpointing
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
Teresa Davies, Christer Karlsson, Hui Liu, Chong D...
SPAA
2004
ACM
15 years 9 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
SIGMOD
2003
ACM
145views Database» more  SIGMOD 2003»
16 years 4 months ago
Evaluating Probabilistic Queries over Imprecise Data
Many applications employ sensors for monitoring entities such as temperature and wind speed. A centralized database tracks these entities to enable query processing. Due to contin...
Reynold Cheng, Dmitri V. Kalashnikov, Sunil Prabha...
DILS
2005
Springer
15 years 10 months ago
Information Integration and Knowledge Acquisition from Semantically Heterogeneous Biological Data Sources
Abstract. We present INDUS (Intelligent Data Understanding System), a federated, query-centric system for knowledge acquisition from autonomous, distributed, semantically heterogen...
Doina Caragea, Jyotishman Pathak, Jie Bao, Adrian ...
TIT
2008
110views more  TIT 2008»
15 years 4 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra