2095 search results - page 175 / 419 » Improved pebbling bounds |
167
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
223
click to vote
JMLR
2012
13 years 9 months ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
351
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
263
click to vote
TOG
2012
13 years 9 months ago
2012
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...
210
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...