Sciweavers

387 search results - page 54 / 78
» Many Random Walks Are Faster Than One
Sort
View
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 3 months ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
ASPLOS
2010
ACM
13 years 8 months ago
Best-effort semantic document search on GPUs
Semantic indexing is a popular technique used to access and organize large amounts of unstructured text data. We describe an optimized implementation of semantic indexing and docu...
Surendra Byna, Jiayuan Meng, Anand Raghunathan, Sr...
BMCBI
2008
139views more  BMCBI 2008»
13 years 9 months ago
Abbreviation definition identification based on automatic precision estimates
Background: The rapid growth of biomedical literature presents challenges for automatic text processing, and one of the challenges is abbreviation identification. The presence of ...
Sunghwan Sohn, Donald C. Comeau, Won Kim, W. John ...
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 8 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...
ICCV
2009
IEEE
15 years 2 months ago
What is the Best Multi-Stage Architecture for Object Recognition?
In many recent object recognition systems, feature extraction stages are generally composed of a filter bank, a non-linear transformation, and some sort of feature pooling layer...
Kevin Jarrett, Koray Kavukcuoglu, Marc’Aurelio R...