Sciweavers

106 search results - page 11 / 22
» One Tokenization per Source
Sort
View
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
13 years 11 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
CVPR
2009
IEEE
15 years 4 months ago
Learning from Ambiguously Labeled Images
In many image and video collections, we have access only to partially labeled data. For example, personal photo collections often contain several faces per image and a caption t...
Benjamin Sapp, Benjamin Taskar, Chris Jordan, Timo...
CVPR
2007
IEEE
14 years 11 months ago
Symmetric Objects are Hardly Ambiguous
Given any two images taken under different illumination conditions, there always exist a physically realizable object which is consistent with both the images even if the lighting...
Gaurav Aggarwal, Soma Biswas, Rama Chellappa
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
GLOBECOM
2008
IEEE
14 years 4 months ago
Time Dependent Message Spraying for Routing in Intermittently Connected Networks
—Intermittently connected mobile networks, also called Delay Tolerant Networks (DTNs), are wireless networks in which at any given time instance, the probability of having a comp...
Eyuphan Bulut, Zijian Wang, Boleslaw K. Szymanski