Sciweavers

28888 search results - page 51 / 5778
» Computability and complexity in analysis
Sort
View
WSC
2008
13 years 10 months ago
Simulation-based optimization of a complex mail transportation network
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin And...
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
STACS
2010
Springer
14 years 2 months ago
Reflections on Multivariate Algorithmics and Problem Parameterization
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
Rolf Niedermeier
BMCBI
2006
122views more  BMCBI 2006»
13 years 8 months ago
Computational reconstruction of transcriptional regulatory modules of the yeast cell cycle
Background: A transcriptional regulatory module (TRM) is a set of genes that is regulated by a common set of transcription factors (TFs). By organizing the genome into TRMs, a liv...
Wei-Sheng Wu, Wen-Hsiung Li, Bor-Sen Chen
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
12 years 10 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu