Sciweavers

562 search results - page 88 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
CVPR
2010
IEEE
14 years 2 months ago
Weakly-Supervised Hashing in Kernel Space
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
Yadong Mu, Jialie Shen, Shuicheng Yan
CDC
2010
IEEE
107views Control Systems» more  CDC 2010»
13 years 3 months ago
Time-synchronization in mobile sensor networks from difference measurements
We examine distributed time-synchronization in mobile ad-hoc and sensor networks. The problem is to estimate the skews and offsets of clocks of all the nodes with respect to an arb...
Chenda Liao, Prabir Barooah
PRL
2011
12 years 11 months ago
Structural matching of 2D electrophoresis gels using deformed graphs
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...
Alexandre Noma, Alvaro Pardo, Roberto Marcondes Ce...
TOG
2012
246views Communications» more  TOG 2012»
11 years 11 months ago
Continuous penalty forces
We present a simple algorithm to compute continuous penalty forces to determine collision response between rigid and deformable models bounded by triangle meshes. Our algorithm co...
Min Tang, Dinesh Manocha, Miguel A. Otaduy, Ruofen...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 11 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald