Search
Now showing items 51-60 of 72
LIBPMK: A Pyramid Match Toolkit
(2008-04-07)
LIBPMK is a C++ implementation of Grauman and Darrell's pyramid match algorithm. This toolkit provides a flexible framework with which developers can quickly match sets of image features and run experiments. LIBPMK provides ...
A Note on Perturbation Results for Learning Empirical Operators
(2008-08-19)
A large number of learning algorithms, for example, spectral clustering, kernel Principal Components Analysis and many manifold methods are based on estimating eigenvalues and eigenfunctions of operators defined by a ...
Organic Indoor Location Discovery
(2008-12-30)
We describe an indoor, room-level location discovery method based on spatial variations in "wifi signatures," i.e., MAC addresses and signal strengths of existing wireless access points. The principal novelty of our system ...
Cabernet: A Content Delivery Network for Moving Vehicles
(2008-01-17)
This paper describes the design, implementation, and evaluation of Cabernet, a system to deliver data to and from moving vehicles using open 802.11 (WiFi) access points encountered opportunistically during travel. Network ...
Efficient Object Recognition and Image Retrieval for Large-Scale Applications
(2008-05-06)
Algorithms for recognition and retrieval tasks generally call for both speed and accuracy. When scaling up to very large applications, however, we encounter additional significant requirements: adaptability and scalability. ...
Understanding camera trade-offs through a Bayesian analysis of light field projections
(2008-04-16)
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinhole optics. The development of computational imaging is broadening this scope; a variety of ...
New-Age Cryptography
(2008-04-16)
We introduce new and general complexity theoretic hardness assumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than traditional cryptographic hardness assumptions; ...
Random-World Semantics and Syntactic Independence for Expressive Languages
(2008-05-03)
We consider three desiderata for a language combining logic and probability: logical expressivity, random-world semantics, and the existence of a useful syntactic condition for probabilistic independence. Achieving these ...
Block Heavy Hitters
(2008-05-02)
e study a natural generalization of the heavy hitters problem in thestreaming context. We term this generalization *block heavy hitters* and define it as follows. We are to stream over a matrix$A$, and report all *rows* ...
Transferring Nonlinear Representations using Gaussian Processes with a Shared Latent Space
(2008-04-11)
When a series of problems are related, representations derived from learning earlier tasks may be useful in solving later problems. In this paper we propose a novel approach to transfer learning with low-dimensional, ...