Sciweavers

670 search results - page 82 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
SWAT
2010
Springer
204views Algorithms» more  SWAT 2010»
13 years 5 months ago
Feasible and Accurate Algorithms for Covering Semidefinite Programs
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
Garud Iyengar, David J. Phillips, Clifford Stein
ICRA
2009
IEEE
188views Robotics» more  ICRA 2009»
13 years 5 months ago
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
Daniel Munoz, Nicolas Vandapel, Martial Hebert
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 5 months ago
Performance evaluation of parallel manipulators for milling application
This paper focuses on the performance evaluation of the parallel manipulators for milling of composite materials. For this application the most significant performance measurement...
Anatoly Pashkevich, Alexandr Klimchik, Séba...
WWW
2011
ACM
13 years 2 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...
TSP
2010
13 years 2 months ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...