Sciweavers

1333 search results - page 76 / 267
» Not a Number of Floating Point Problems
Sort
View
119
Voted
JAT
2010
71views more  JAT 2010»
15 years 2 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
15 years 3 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
112
Voted
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
15 years 2 months ago
Immobilizing 2D serial chains in form closure grasps
: The immobilization of non-rigid objects is currently an active research area in robotics. This paper explores the problem by studying the immobilization of serial chains of rigid...
Elon Rimon, A. Frank van der Stappen
127
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
132
Voted
LPAR
2005
Springer
15 years 9 months ago
Another Complete Local Search Method for SAT
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
Haiou Shen, Hantao Zhang