Sciweavers

4372 search results - page 185 / 875
» Algorithmic Theories of Everything
Sort
View
91
Voted
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
16 years 1 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ASIACRYPT
2009
Springer
15 years 7 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
84
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
Optimizing File Availability in Peer-to-Peer Content Distribution
Abstract— A fundamental paradigm in peer-to-peer (P2P) content distribution is that of a large community of intermittentlyconnected nodes that cooperate to share files. Because ...
Jussi Kangasharju, Keith W. Ross, David A. Turner
101
Voted
GLVLSI
2006
IEEE
98views VLSI» more  GLVLSI 2006»
15 years 6 months ago
Rapid intermodulation distortion estimation in fully balanced weakly nonlinear Gm-C filters using state-space modeling
State-space modeling of fully differential Gm-C filters with weak nonlinearities is used to develop a fast algorithm for intermodulation distortion estimation. It results in sim...
Paul Sotiriadis, Abdullah Celik, Zhaonian Zhang
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
15 years 6 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener