Sciweavers

1857 search results - page 98 / 372
» Minimum Degree Orderings
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Learning a Hidden Matching
We consider the problem of learning a matching (i.e., a graph in which all vertices have degree 0 or 1) in a model where the only allowed operation is to query whether a set of ve...
Noga Alon, Richard Beigel, Simon Kasif, Steven Rud...
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
15 years 11 months ago
On-Line Multicasting in All-Optical Networks
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
Kenta Hashimoto, Toshinori Yamada, Shuichi Ueno
ICRA
1994
IEEE
99views Robotics» more  ICRA 1994»
15 years 10 months ago
An Optimal Sonar Array for Target Localization and Classification
A novel sonar array for mobile robots is presented with applications to localization and mapping of indoor environments. The ultrasonic sensor localizes and classifies multiple ta...
Lindsay Kleeman, Roman Kuc
COMPGEOM
1994
ACM
15 years 10 months ago
Matching Shapes with a Reference Point
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
Helmut Alt, Oswin Aichholzer, Günter Rote
ICALP
1991
Springer
15 years 10 months ago
The Expected Extremes in a Delaunay Triangulation
We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to...
Marshall W. Bern, David Eppstein, F. Frances Yao