Sciweavers

358 search results - page 64 / 72
» GCD of Many Integers
Sort
View
124
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
Intelligent Distribution of Intrusion Prevention Services on Programmable Routers
— The recent surge of new viruses and host attacks in the Internet and the tremendous propagation speed of selfdistributing attacks has made network security a pressing issue. To...
Andreas Hess, Hans-Florian Geerdes, Roland Wess&au...
113
Voted
ISCA
2006
IEEE
148views Hardware» more  ISCA 2006»
15 years 9 months ago
Tolerating Dependences Between Large Speculative Threads Via Sub-Threads
Thread-level speculation (TLS) has proven to be a promising method of extracting parallelism from both integer and scientific workloads, targeting speculative threads that range ...
Christopher B. Colohan, Anastassia Ailamaki, J. Gr...
170
Voted
SIGSOFT
2006
ACM
15 years 9 months ago
Bit level types for high level reasoning
Bitwise operations are commonly used in low-level systems code to access multiple data fields that have been packed into a single word. Program analysis tools that reason about s...
Ranjit Jhala, Rupak Majumdar
145
Voted
SPAA
2006
ACM
15 years 9 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
133
Voted
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 9 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál