5153 search results - page 255 / 1031 » Introduction to Randomized Algorithms |
184
click to vote
ICDCS
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Nowadays companies increasingly aggregate location data from different sources on the Internet to offer locationbased services such as estimating current road traffic c...
147
click to vote
ISAAC
1999
Springer
15 years 10 months ago
1999
Springer
We study the online problem of holding a number of idle threads on an application server, which we have ready for processing new requests. The problem stems from the fact that bot...
199
Voted
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
174
click to vote
TNN
2011
15 years 1 months ago
2011
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...
169
click to vote
HICSS
2006
IEEE
16 years 17 days ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...