Sciweavers

239 search results - page 35 / 48
» A Simple Algorithm for Computing the Lempel Ziv Factorizatio...
Sort
View
ICCV
2007
IEEE
14 years 10 months ago
Supervised Learning of Image Restoration with Convolutional Networks
Convolutional networks have achieved a great deal of success in high-level vision problems such as object recognition. Here we show that they can also be used as a general method ...
Viren Jain, Joseph F. Murray, Fabian Roth, Sriniva...
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
14 years 8 months ago
Low-distortion embeddings of general metrics into the line
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...
Mihai Badoiu, Julia Chuzhoy, Piotr Indyk, Anastasi...
WWW
2006
ACM
14 years 9 months ago
Browsing on small screens: recasting web-page segmentation into an efficient machine learning framework
Fitting enough information from webpages to make browsing on small screens compelling is a challenging task. One approach is to present the user with a thumbnail image of the full...
Shumeet Baluja
ISCA
2006
IEEE
107views Hardware» more  ISCA 2006»
14 years 2 months ago
Distributed Arithmetic on a Quantum Multicomputer
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and t...
Rodney Van Meter, Kae Nemoto, W. J. Munro, Kohei M...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa