Sciweavers

11231 search results - page 1786 / 2247
» Digging for Data Structures
Sort
View
ICS
2003
Tsinghua U.
15 years 10 months ago
Inferential queueing and speculative push for reducing critical communication latencies
Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of Inferentially...
Ravi Rajwar, Alain Kägi, James R. Goodman
175
Voted
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 9 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
145
Voted
ERCIMDL
2009
Springer
177views Education» more  ERCIMDL 2009»
15 years 9 months ago
Curated Databases
Curated databases are databases that are populated and updated with a great deal of human effort. Most reference works that one traditionally found on the reference shelves of li...
Peter Buneman
IWVF
2001
Springer
15 years 9 months ago
Volume and Surface Area Distributions of Cracks in Concrete
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
George Nagy, Tong Zhang, W. R. Franklin, Eric Land...
DCC
2000
IEEE
15 years 9 months ago
Multi-Resolution Adaptation of the SPIHT Algorithm for Multiple Description
Multiple description codes are data compression algorithms designed with the goal of minimizing the distortion caused by data loss in packet-based or diversity communications syst...
Nedeljko Varnica, Michael Fleming, Michelle Effros
« Prev « First page 1786 / 2247 Last » Next »