485 search results - page 71 / 97 » Iterative Bounding LAO |
AAAI
2010
15 years 2 months ago
2010
In a previous paper, Liu argued for the importance of establishing a precise theoretical foundation for program debugging from first principles. In this paper, we present a first ...
123
click to vote
SIAMCOMP
1998
15 years 5 days ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
125
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
97
Voted
CVPR
2000
IEEE
16 years 2 months ago
2000
IEEE
Many natural images contain reflections and transparency, i.e., they contain mixtures of reflected and transmitted light. When viewed from a moving camera, these appear as the sup...
106
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We introduce a distributed algorithm for solving large scale Support Vector Machines (SVM) problems. The algorithm divides the training set into a number of processing nodes each ...