Sciweavers

4926 search results - page 463 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
ICRA
2005
IEEE
105views Robotics» more  ICRA 2005»
15 years 9 months ago
A New Approach to the Use of Edge Extremities for Model-based Object Tracking
— This paper presents a robust model-based visual tracking algorithm that can give accurate 3D pose of a rigid object. Our tracking algorithm uses an incremental pose update sche...
Youngrock Yoon, Akio Kosaka, Jae Byung Park, Avina...
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 4 months ago
On proximity oblivious testing
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
Oded Goldreich, Dana Ron
125
Voted
CGF
1998
101views more  CGF 1998»
15 years 3 months ago
Rapid and Accurate Contact Determination between Spline Models using ShellTrees
In this paper, we present an e cient algorithm for contact determination between spline models. We make use of a new hierarchy, called ShellTree, that comprises of spherical shell...
Shankar Krishnan, M. Gopi, Ming C. Lin, Dinesh Man...
146
Voted
CIE
2007
Springer
15 years 10 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
138
Voted
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
15 years 8 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass