Sciweavers

16404 search results - page 3146 / 3281
» A set coverage problem
Sort
View
JCDL
2004
ACM
181views Education» more  JCDL 2004»
15 years 9 months ago
The 3D vase museum: a new approach to context in a digital library
We present a new approach to displaying and browsing a digital library collection, a set of Greek vases in the Perseus digital library. Our design takes advantage of three-dimensi...
Horn-yeu Shiaw, Robert J. K. Jacob, Gregory R. Cra...
122
Voted
PLDI
2004
ACM
15 years 9 months ago
Vectorization for SIMD architectures with alignment constraints
When vectorizing for SIMD architectures that are commonly employed by today’s multimedia extensions, one of the new challenges that arise is the handling of memory alignment. Pr...
Alexandre E. Eichenberger, Peng Wu, Kevin O'Brien
SASN
2004
ACM
15 years 9 months ago
Revisiting random key pre-distribution schemes for wireless sensor networks
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...
Joengmin Hwang, Yongdae Kim
136
Voted
SIGIR
2004
ACM
15 years 9 months ago
An automatic weighting scheme for collaborative filtering
Collaborative filtering identifies information interest of a particular user based on the information provided by other similar users. The memory-based approaches for collaborativ...
Rong Jin, Joyce Y. Chai, Luo Si
SPAA
2004
ACM
15 years 9 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
« Prev « First page 3146 / 3281 Last » Next »