Sciweavers

241 search results - page 11 / 49
» Shape Analysis as a Generalized Path Problem
Sort
View
JALC
2002
97views more  JALC 2002»
13 years 7 months ago
Semiring Frameworks and Algorithms for Shortest-Distance Problems
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
Mehryar Mohri
COMPGEOM
2004
ACM
14 years 1 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
IMC
2007
ACM
13 years 9 months ago
Acyclic type-of-relationship problems on the internet: an experimental analysis
An experimental study of the feasibility and accuracy of the acyclicity approach introduced in [14] for the inference of business relationships among autonomous systems (ASes) is ...
Benjamin Hummel, Sven Kosub
TROB
2010
176views more  TROB 2010»
13 years 2 months ago
Modeling Deformations of General Parametric Shells Grasped by a Robot Hand
The robot hand applying force on a deformable object will result in a changing wrench space due to the varying shape and normal of the contact area. Design and analysis of a manipu...
Jiang Tian, Yan-Bin Jia
CORR
2006
Springer
79views Education» more  CORR 2006»
13 years 7 months ago
May We Have Your Attention: Analysis of a Selective Attention Task
In this paper we present a deeper analysis than has previously been carried out of a selective attention problem, and the evolution of continuous-time recurrent neural networks to...
Eldan Goldenberg, Jacob R. Garcowski, Randall D. B...