Search
Now showing items 4031-4040 of 4210
Numerical Shape from Shading and Occluding Contours in a Single View
(MIT Artificial Intelligence Laboratory, 1979-11)
An iterative method of using occluding boundary information is proposed to compute surface slope from shading.
We use a stereographic space rather than the more commonly used gradient space in order to express occluding ...
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, ...
Introduction to Using the Window System
(MIT Artificial Intelligence Laboratory, 1982-10-14)
This document is a draft copy of a portion of the Lisp Machine window system manual. It is being published in this form now to make it available, since the complete window system manual is unlikely to be finished in the ...
Generalization of the MV Mechanism
(2008-05-01)
Micali and Valiant proposed a mechanism for combinatorial auctions that is dominant-strategy truthful, guarantees reasonably high revenue, and is very resilient against collusions. Their mechanism, however, uses as a ...
Event Order Abstraction for Parametric Real-Time System Verification
(2008-07-28)
We present a new abstraction technique, event order abstraction (EOA), for parametric safety verification of real-time systems in which ``correct orderings of events'' needed for system correctness are maintained by timing ...