Sciweavers

7228 search results - page 556 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Fixed point iteration for max-min sir balancing with general interference functions
This paper studies the convergence of a fixed point iteration algorithm for the problem of max-min signal-to-interference ratio (SIR) balancing. Differently from the existing wor...
Nikola Vucic, Martin Schubert
DIMVA
2007
15 years 8 months ago
On the Adaptive Real-Time Detection of Fast-Propagating Network Worms
Abstract. We present two light-weight worm detection algorithms that offer significant advantages over fixed-threshold methods. The first algorithm, RBS (ratebased sequential hy...
Jaeyeon Jung, Rodolfo A. Milito, Vern Paxson
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 18 days 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
194
Voted
CIKM
2011
Springer
14 years 7 months ago
Scalable entity matching computation with materialization
Entity matching (EM) is the task of identifying records that refer to the same real-world entity from different data sources. While EM is widely used in data integration and data...
Sanghoon Lee, Jongwuk Lee, Seung-won Hwang
168
Voted
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 7 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...