Sciweavers

3134 search results - page 128 / 627
» Computing full disjunctions
Sort
View
116
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 1 days ago
Fast Pseudo-Random Fingerprints
Abstract. We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather the...
Yoram Bachrach, Ely Porat
113
Voted
TOG
2010
142views more  TOG 2010»
14 years 9 months ago
Free-flowing granular materials with two-way solid coupling
We present a novel continuum-based model that enables efficient simulation of granular materials. Our approach fully solves the internal pressure and frictional stresses in a gran...
Rahul Narain, Abhinav Golas, Ming C. Lin
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
16 years 10 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...
131
Voted
SODA
2008
ACM
100views Algorithms» more  SODA 2008»
15 years 4 months ago
A tight lower bound for parity in noisy communication networks
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
Chinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Ja...
CVPR
2001
IEEE
16 years 4 months ago
Fast Focal Length Solution in Partial Panoramic Image Stitching
Accurate estimation of effective camera focal length is crucial to the success of panoramic image stitching. Fast techniques for estimating the focal length exist, but are depende...
Kirk L. Duffin, William A. Barrett