Sciweavers

1632 search results - page 71 / 327
» On special numberings of hypergraphs
Sort
View
ISAAC
2001
Springer
116views Algorithms» more  ISAAC 2001»
15 years 10 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
FOCS
1998
IEEE
15 years 10 months ago
Unsatisfiable Systems of Equations, Over a Finite Field
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
Alan R. Woods
PEPM
1998
ACM
15 years 10 months ago
Inherited Limits
We show the evolution of partial evaluators over the past ten years from a particular perspective: the attempt to remove limits on the structure of residual programs that are inher...
Torben Æ. Mogensen
PODS
1993
ACM
161views Database» more  PODS 1993»
15 years 10 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...
CCCG
2008
15 years 7 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...