Sciweavers

1355 search results - page 124 / 271
» Alternating Timed Automata over Bounded Time
Sort
View
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 3 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
IROS
2006
IEEE
97views Robotics» more  IROS 2006»
14 years 3 months ago
Probabilistic Search for a Moving Target in an Indoor Environment
– We consider a search for a target moving within a known indoor environment partitioned into interconnected regions of varying sizes. The knowledge of target location is describ...
Haye Lau, Shoudong Huang, Gamini Dissanayake
VR
1999
IEEE
151views Virtual Reality» more  VR 1999»
14 years 1 months ago
A Framework for Fast and Accurate Collision Detection for Haptic Interaction
We present a framework for fast and accurate collision detection for haptic interaction with polygonal models. Given a model, we pre-compute a hybrid hierarchical representation, ...
Arthur D. Gregory, Ming C. Lin, Stefan Gottschalk,...
FOCS
1997
IEEE
14 years 1 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
ISTCS
1993
Springer
14 years 1 months ago
Random Walks on Colored Graphs
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and   distinct sets of edges, each of which has a color. A par...
Anne Condon, Diane Hernek