Search
Now showing items 4041-4050 of 4210
Elastic-Net Regularization in Learning Theory
(2008-07-24)
Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie ["Regularization and variable selection via the elastic net" J. R. Stat. ...
An $\Omega(n \log n)$ Lower Bound on the Cost of Mutual Exclusion
(2006-07-23)
We prove an $\Omega(n \log n)$ lower bound on the number ofnon-busywaiting memory accesses by any deterministic algorithm solving$n$ process mutual exclusion that communicates via shared registers.The cost of the algorithm ...
Understanding camera trade-offs through a Bayesian analysis of light field projections - A revision
(2008-07-28)
Computer vision has traditionally focused on extracting structure,such as depth, from images acquired using thin-lens or pinholeoptics. The development of computational imaging is broadening thisscope; a variety of ...
Transductive Ranking on Graphs
(2008-08-07)
In ranking, one is given examples of order relationships among objects, and the goal is to learn from these examples a real-valued ranking function that induces a ranking or ordering over the object space. We consider the ...
Adaptive Envelope MDPs for Relational Equivalence-based Planning
(2008-07-29)
We describe a method to use structured representations of the environmentâ s dynamics to constrain and speed up the planning process. Given a problem domain described in a probabilistic logical description language, we ...
A Projected Subgradient Method for Scalable Multi-Task Learning
(2008-07-23)
Recent approaches to multi-task learning have investigated the use of a variety of matrix norm regularization schemes for promoting feature sharing across tasks.In essence, these approaches aim at extending the l1 framework ...
Dependency-Directed Backtracking in Non-Deterministic Scheme
(MIT Artificial Intelligence Laboratory, 1988-08)
Non-deterministic LISP can be used to describe a search problem without specifying the method used to solve the problem. We show that SCHEMER, a non-deterministic dialect of SCHEME, can support dependency-directed backtracking ...
A Stored Picture Hacking Facility
(MIT Artificial Intelligence Laboratory, 1972-06)
A short description of LISP functions that have been written for use with the stored picture facility. These functions allow one to display an image of a stored scene on the 340 scope, and produce graphs and histograms of ...
Automatic Creation of SQL Injection and Cross-Site Scripting Attacks
(2008-09-10)
We present a technique for finding security vulnerabilitiesin Web applications. SQL Injection (SQLI) and cross-sitescripting (XSS) attacks are widespread forms of attackin which the attacker crafts the input to the application ...
Stochastic Combinatorial Optimization with Risk
(2008-09-13)
We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding ...