Sciweavers

4843 search results - page 854 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
77
Voted
OPODIS
2004
14 years 11 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
NIPS
2001
14 years 11 months ago
The Emergence of Multiple Movement Units in the Presence of Noise and Feedback Delay
Tangential hand velocity profiles of rapid human arm movements often appear as sequences of several bell-shaped acceleration-deceleration phases called submovements or movement un...
Michael Kositsky, Andrew G. Barto
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
14 years 11 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
IJCAI
2003
14 years 11 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
68
Voted
IJCAI
2003
14 years 11 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...