Sciweavers

770 search results - page 82 / 154
» Toward an Optimal Redundancy Strategy for Distributed Comput...
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Runtime Optimization of Application Level Communication Patterns
— This paper introduces the Abstract Data and Communication Library (ADCL). ADCL is an application level communication library aiming at providing the highest possible performanc...
Edgar Gabriel, Shuo Huang
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 6 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CCGRID
2006
IEEE
14 years 1 months ago
Exploit Failure Prediction for Adaptive Fault-Tolerance in Cluster Computing
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
Yawei Li, Zhiling Lan
ECAI
2006
Springer
13 years 11 months ago
Possibilistic Influence Diagrams
Abstract. In this article we present the framework of Possibilistic Influence Diagrams (PID), which allow to model in a compact form problems of sequential decision making under un...
Laurent Garcia, Régis Sabbadin