Sciweavers

172 search results - page 5 / 35
» Separation of Nonconvex Sets with General Augmenting Functio...
Sort
View
ICALP
2001
Springer
13 years 12 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
SIAMJO
2011
13 years 2 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
ECOOP
2005
Springer
14 years 1 months ago
Open Modules: Modular Reasoning About Advice
Advice is a mechanism used by advanced object-oriented and aspect-oriented programming languages to augment the behavior of methods in a program. Advice can help to make programs m...
Jonathan Aldrich
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 2 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
IJCV
2006
100views more  IJCV 2006»
13 years 7 months ago
A General Framework for Combining Visual Trackers - The "Black Boxes" Approach
Abstract. Over the past few years researchers have been investigating the enhancement of visual tracking performance by devising trackers that simultaneously make use of several di...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin