Sciweavers

7773 search results - page 126 / 1555
» On generalized Frame-Stewart numbers
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
WWW
2004
ACM
15 years 10 months ago
Design of a crawler with bounded bandwidth
This paper presents an algorithm to bound the bandwidth of a Web crawler. The crawler collects statistics on the transfer rate of each server to predict the expected bandwidth use...
Michelangelo Diligenti, Marco Maggini, Filippo Mar...
DCC
2003
IEEE
15 years 9 months ago
Design of Optimal Quantizers for Distributed Source Coding
We address the problem of designing optimal quantizers for distributed source coding. The generality of our formulation includes both the symmetric and asymmetric scenarios, toget...
David Rebollo-Monedero, Rui Zhang, Bernd Girod
FOSSACS
2010
Springer
15 years 4 months ago
Counting CTL
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...
François Laroussinie, Antoine Meyer, Eudes ...
ICCS
2004
Springer
15 years 3 months ago
A Fast Multifrontal Solver for Non-linear Multi-physics Problems
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
Alberto Bertoldo, Mauro Bianco, Geppino Pucci