Sciweavers

2255 search results - page 101 / 451
» Computing a Center-Transversal Line
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 4 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
FQ
2003
Springer
15 years 4 months ago
Symplectic Spreads and Permutation Polynomials
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
Simeon Ball, Michael Zieve
COMPUTER
2006
104views more  COMPUTER 2006»
14 years 11 months ago
CALM and Cadena: Metamodeling for Component-Based Product-Line Development
egrating middleware layer that abstracts the execution environment and implements services and communication channels, and
Adam Childs, Jesse Greenwald, Georg Jung, Matthew ...
DIMACS
2001
15 years 14 days ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald
ICCV
1998
IEEE
15 years 3 months ago
Reading between the lines: A method for extracting dynamic 3D with Texture
Marc Proesmans, Luc J. Van Gool, Filip Defoort