Sciweavers

6365 search results - page 885 / 1273
» Fast Local Computation Algorithms
Sort
View
VEE
2009
ACM
172views Virtualization» more  VEE 2009»
16 years 2 months ago
Entropy: a consolidation manager for clusters
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...
Fabien Hermenier, Xavier Lorca, Jean-Marc Menaud, ...
222
Voted
CONEXT
2009
ACM
15 years 8 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
ALT
2010
Springer
15 years 9 months ago
Contrast Pattern Mining and Its Application for Building Robust Classifiers
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
Kotagiri Ramamohanarao
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
15 years 9 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
CGF
2007
149views more  CGF 2007»
15 years 7 months ago
Interactive Simulation of the Human Eye Depth of Field and Its Correction by Spectacle Lenses
This paper describes a fast rendering algorithm for verification of spectacle lens design. Our method simulates refraction corrections of astigmatism as well as myopia or presbyo...
Masanori Kakimoto, Tomoaki Tatsukawa, Yukiteru Muk...