Sciweavers

10493 search results - page 1961 / 2099
» Dynamic Word Problems
Sort
View
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 7 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
COMCOM
1998
83views more  COMCOM 1998»
13 years 7 months ago
System for screening objectionable images
As computers and Internet become more and more available to families, access of objectionable graphics by children is increasingly a problem that many parents are concerned about....
James Ze Wang, Jia Li, Gio Wiederhold, Oscar Firsc...
ALGORITHMICA
1999
141views more  ALGORITHMICA 1999»
13 years 7 months ago
Design and Implementation of a Practical Parallel Delaunay Algorithm
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
DM
1998
81views more  DM 1998»
13 years 7 months ago
On intersecting hypergraphs
We investigate the following question: “Given an intersecting multi-hypergraph on n points, what fraction of edges must be covered by any of the best 2 points?” (Here “best...
Barry Guiduli, Zoltán Király
CN
1999
100views more  CN 1999»
13 years 7 months ago
Testing protocols modeled as FSMs with timing parameters
An optimization method is introduced for generating minimum-length test sequences taking into account timing constraints for FSM models of communication protocols. Due to active t...
M. Ümit Uyar, Mariusz A. Fecko, Adarshpal S. ...
« Prev « First page 1961 / 2099 Last » Next »