Sciweavers

4047 search results - page 325 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICML
2003
IEEE
16 years 7 months ago
Online Feature Selection using Grafting
In the standard feature selection problem, we are given a fixed set of candidate features for use in a learning problem, and must select a subset that will be used to train a mode...
Simon Perkins, James Theiler
ICML
1996
IEEE
16 years 7 months ago
Unsupervised Learning Using MML
This paper discusses the unsupervised learning problem. An important part of the unsupervised learning problem is determining the numberofconstituent groups (componentsor classes)...
Jonathan J. Oliver, Rohan A. Baxter, Chris S. Wall...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 6 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
EMMCVPR
2009
Springer
16 years 1 months ago
A PDE Approach to Coupled Super-Resolution with Non-parametric Motion
The problem of recovering a high-resolution image from a set of distorted (e.g., warped, blurred, noisy) and low-resolution images is known as super-resolution. Accurate motion est...
Mehran Ebrahimi, Anne L. Martel
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 27 days ago
Auditing a Batch of SQL Queries
In this paper, we study the problem of auditing a batch of SQL queries: given a set of SQL queries that have been posed over a database, determine whether some subset of these quer...
Rajeev Motwani, Shubha U. Nabar, Dilys Thomas