Sciweavers

3875 search results - page 720 / 775
» Approximation Algorithms for the Max-coloring Problem
Sort
View
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 8 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
SIGMOD
2003
ACM
111views Database» more  SIGMOD 2003»
14 years 7 months ago
Extended Wavelets for Multiple Measures
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...
Antonios Deligiannakis, Nick Roussopoulos
CVPR
2010
IEEE
14 years 3 months ago
A Steiner Tree approach to efficient object detection
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
Olga Russakovsky, Quoc Le, Andrew Ng
FOCS
2009
IEEE
14 years 2 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
ICRA
2009
IEEE
231views Robotics» more  ICRA 2009»
14 years 2 months ago
Accurate 3D ground plane estimation from a single image
— Accurate localization of landmarks in the vicinity of a robot is a first step towards solving the SLAM problem. In this work, we propose algorithms to accurately estimate the ...
Anoop Cherian, Vassilios Morellas, Nikolaos Papani...