Sciweavers

3415 search results - page 587 / 683
» Lower Bounds for Kernelizations
Sort
View
COMBINATORICS
2000
63views more  COMBINATORICS 2000»
13 years 10 months ago
A Ramsey Treatment of Symmetry
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
Taras O. Banakh, O. V. Verbitsky, Ya. Vorobets
COMCOM
2000
96views more  COMCOM 2000»
13 years 10 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
ECCC
2000
158views more  ECCC 2000»
13 years 10 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
CORR
2002
Springer
104views Education» more  CORR 2002»
13 years 10 months ago
Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible
We examine a computational geometric problem concerning the structure of polymers. We model a polymer as a polygonal chain in three dimensions. Each edge splits the polymer into t...
Michael A. Soss, Jeff Erickson, Mark H. Overmars
DM
2002
95views more  DM 2002»
13 years 10 months ago
On the superconnectivity of generalized p-cycles
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
Camino Balbuena, Ignacio M. Pelayo, J. Góme...