Sciweavers

9842 search results - page 1392 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
15 years 11 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
CVPR
2000
IEEE
15 years 11 months ago
Provably Fast Algorithms for Contour Tracking
A new tracker is presented. Two sets are identified: one which contains all possible curves as found in the image, and a second which contains all curves which characterize the o...
Daniel Freedman, Michael S. Brandstein
ICRA
2000
IEEE
84views Robotics» more  ICRA 2000»
15 years 11 months ago
Enhancing Randomized Motion Planners: Exploring with Haptic Hints
In this paper, we investigate methods for enabling a human operator and an automatic motion planner to cooperatively solve a motion planning query. Our work is motivated by our ex...
O. Burçhan Bayazit, Guang Song, Nancy M. Am...
ICTAI
2000
IEEE
15 years 11 months ago
Consistency checking for Euclidean spatial constraints: a dimension graph approach
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
Xuan Liu, Shashi Shekhar, Sanjay Chawla
IPPS
2000
IEEE
15 years 11 months ago
Consensus Based on Failure Detectors with a Perpetual Accuracy Property
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
Achour Mostéfaoui, Michel Raynal
« Prev « First page 1392 / 1969 Last » Next »