Sciweavers

1554 search results - page 92 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CEC
2007
IEEE
15 years 4 months ago
Multi-population approach to approximate the development of neocortical networks
— Cultured natural cortical neurons form functional networks through a complex set of developmental steps during the first weeks in vitro. The dynamic behavior of the network in...
Andreas Herzog, Karsten Kube, Bernd Michaelis, Ana...
FOCS
2009
IEEE
15 years 9 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
TCS
2008
15 years 2 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
SODA
2010
ACM
177views Algorithms» more  SODA 2010»
16 years 12 days ago
On the Exact Space Complexity of Sketching and Streaming Small Norms
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
ICASSP
2008
IEEE
15 years 9 months ago
Approximation and resampling of tapped delay line channel models with guaranteed channel properties
In this paper, we present a novel framework for resampling and complexity reduction of tapped delay line channel models. In contrast to related algorithms in this field, our fram...
Christian Mehlführer, Markus Rupp