Sciweavers

1449 search results - page 110 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
IROS
2007
IEEE
137views Robotics» more  IROS 2007»
16 years 18 days ago
Energy-based 6-DOF penetration depth computation for penalty-based haptic rendering algorithms
Abstract— Existing penalty-based haptic rendering approaches compute penetration depth in strictly translational sense and cannot properly take object rotation into account. We a...
Maxim Kolesnikov, Milos Zefran
PRICAI
2004
Springer
15 years 11 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
ICPR
2002
IEEE
16 years 7 months ago
An Iterative Algorithm for Optimal Style Conscious Field Classification
Modeling consistency of style in isogenous fields of patterns (such as character patterns in a word from the same font or writer) can improve classification accuracy. Since such p...
Prateek Sarkar
CADE
2003
Springer
16 years 6 months ago
Algorithms for Ordinal Arithmetic
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning...
Panagiotis Manolios, Daron Vroon
IWPEC
2009
Springer
16 years 26 days ago
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...