Sciweavers

1552 search results - page 133 / 311
» On the Complexity of Constant Propagation
Sort
View
TALG
2010
86views more  TALG 2010»
15 years 4 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
UC
2009
Springer
16 years 1 months ago
Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
Masashi Aono, Yoshito Hirata, Masahiko Hara, Kazuy...
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 11 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
WAE
1998
118views Algorithms» more  WAE 1998»
15 years 7 months ago
Guarding Scenes against Invasive Hypercubes
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
Mark de Berg, Haggai David, Matthew J. Katz, Mark ...
MOC
2002
131views more  MOC 2002»
15 years 6 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson