Sciweavers

213 search results - page 33 / 43
» The randomized complexity of initial value problems
Sort
View
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
FGR
2004
IEEE
132views Biometrics» more  FGR 2004»
13 years 11 months ago
Expand Training Set for Face Detection by GA Re-sampling
Data collection for both training and testing a classifier is a tedious but essential step towards face detection and recognition. All of the statistical methods suffer from this ...
Jie Chen, Xilin Chen, Wen Gao
ICRA
2006
IEEE
190views Robotics» more  ICRA 2006»
14 years 1 months ago
An Integrated Approach to Inverse Kinematics and Path Planning for Redundant Manipulators
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
Dominik Bertram, James Kuffner, Rüdiger Dillm...
KSEM
2009
Springer
14 years 2 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
PDPTA
2004
13 years 9 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo