Sciweavers

218 search results - page 36 / 44
» Strong Bounds Consistencies and Their Application to Linear ...
Sort
View
NIPS
2008
13 years 10 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
ICLP
1997
Springer
14 years 22 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CORR
2010
Springer
170views Education» more  CORR 2010»
13 years 8 months ago
Global Optimization for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bili...
Marek Petrik, Shlomo Zilberstein
SMA
2010
ACM
171views Solid Modeling» more  SMA 2010»
13 years 8 months ago
Efficient simplex computation for fixture layout design
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
Yu Zheng, Ming C. Lin, Dinesh Manocha
ICRA
2007
IEEE
111views Robotics» more  ICRA 2007»
14 years 2 months ago
Upper body posture estimation for standing function restoration
— This paper addresses the problem of restoring standing in paralegia via functional electrical stimulation (FES) and investigates the relashionship between body posture and volu...
Gael Pages, Nacim Ramdani, Philippe Fraisse, David...