Sciweavers

1042 search results - page 3 / 209
» Failing First: An Update
Sort
View
CORR
2008
Springer
106views Education» more  CORR 2008»
13 years 10 months ago
Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
Amit M. Bhosle, Teofilo F. Gonzalez
CHI
2008
ACM
14 years 10 months ago
What to do when search fails: finding information by association
Sometimes people cannot remember the names or locations of things on their computer, but they can remember what other things are associated with them. We created Feldspar, the fir...
Duen Horng Chau, Brad A. Myers, Andrew Faulring
TPDS
2008
89views more  TPDS 2008»
13 years 9 months ago
Algorithm-Based Fault Tolerance for Fail-Stop Failures
Fail-stop failures in distributed environments are often tolerated by checkpointing or message logging. In this paper, we show that fail-stop process failures in ScaLAPACK matrix ...
Zizhong Chen, Jack Dongarra
SIGKDD
2010
146views more  SIGKDD 2010»
13 years 4 months ago
Latent semantic indexing (LSI) fails for TREC collections
The aim of latent semantic indexing (LSI) is to uncover the relationships between terms, hidden concepts, and documents. LSI uses the matrix factorization technique known as singu...
Avinash Atreya, Charles Elkan
MINENET
2005
ACM
14 years 3 months ago
A first step toward understanding inter-domain routing dynamics
BGP updates are triggered by a variety of events such as link failures, resets, routers crashing, configuration changes, and so on. Making sense of these updates and identifying ...
Kuai Xu, Jaideep Chandrashekar, Zhi-Li Zhang