Sciweavers

2766 search results - page 353 / 554
» Algorithms for trigonometric polynomials
Sort
View
LICS
2009
IEEE
15 years 11 months ago
The Inverse Taylor Expansion Problem in Linear Logic
Linear Logic is based on the analogy between algebraic linearity (i.e. commutation with sums and scalar products) and the computer science linearity (i.e. calling inputs only once...
Michele Pagani, Christine Tasson
135
Voted
CPM
2009
Springer
137views Combinatorics» more  CPM 2009»
15 years 11 months ago
The Structure of Level-k Phylogenetic Networks
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
Philippe Gambette, Vincent Berry, Christophe Paul
125
Voted
TAMC
2009
Springer
15 years 11 months ago
Linear Kernel for Planar Connected Dominating Set
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
DSD
2008
IEEE
95views Hardware» more  DSD 2008»
15 years 11 months ago
Programmable Numerical Function Generators for Two-Variable Functions
This paper proposes a design method and programmable architectures for numerical function generators (NFGs) of two-variable functions. To realize a two-variable function in hardwa...
Shinobu Nagayama, Jon T. Butler, Tsutomu Sasao
GLOBECOM
2008
IEEE
15 years 11 months ago
Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
Weiyi Zhang, Guoliang Xue, Jian Tang, Krishnaiyan ...