Sciweavers

1163 search results - page 90 / 233
» Department of Redundancy Department
Sort
View
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
MIR
2010
ACM
229views Multimedia» more  MIR 2010»
16 years 18 days ago
Wavelet, active basis, and shape script: a tour in the sparse land
Sparse coding is a key principle that underlies wavelet representation of natural images. In this paper, we explain that the effort of seeking a common wavelet sparse coding of i...
Zhangzhang Si, Ying Nian Wu
SC
2009
ACM
16 years 16 days ago
Scalable temporal order analysis for large scale debugging
We present a scalable temporal order analysis technique that supports debugging of large scale applications by classifying MPI tasks based on their logical program execution order...
Dong H. Ahn, Bronis R. de Supinski, Ignacio Laguna...
RECSYS
2009
ACM
16 years 7 days ago
An incentive-based architecture for social recommendations
We present an incentive-based architecture for providing recommendations in a social network. We maintain a distinct reputation system for each individual and we rely on users to ...
Rajat Bhattacharjee, Ashish Goel, Konstantinos Kol...
FOCS
2008
IEEE
16 years 6 days ago
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
Amit Chakrabarti, Alexander Jaffe, James R. Lee, J...