Sciweavers

5153 search results - page 567 / 1031
» Introduction to Randomized Algorithms
Sort
View
BROADNETS
2005
IEEE
16 years 2 days ago
Optimal path selection for ethernet over SONET under inaccurate link-state information
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
Satyajeet Ahuja, Marwan Krunz, Turgay Korkmaz
ISAAC
2003
Springer
85views Algorithms» more  ISAAC 2003»
15 years 11 months ago
Geometric Restrictions on Producible Polygonal Protein Chains
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
COMPGEOM
1992
ACM
15 years 10 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
COLT
2008
Springer
15 years 8 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
CACM
2008
131views more  CACM 2008»
15 years 6 months ago
Exterminator: Automatically correcting memory errors with high probability
Programs written in C and C++ are susceptible to memory errors, including buffer overflows and dangling pointers. These errors, which can lead to crashes, erroneous execution, and...
Gene Novark, Emery D. Berger, Benjamin G. Zorn