6393 search results - page 423 / 1279 » Randomized Algorithms on the Mesh |
157
Voted
ISAAC
1999
Springer
15 years 11 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...
215
click to vote
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:...
190
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...
187
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in cylindrical type of dev...
175
Voted
HICSS
2006
IEEE
16 years 27 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...