2354 search results - page 172 / 471 » Randomness, Stochasticity and Approximations |
WG
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
QUESTA
2008
13 years 9 months ago
2008
To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s . I...
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
GLOBECOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper, we propose an analytical model to capture the dynamics of the RED algorithm. We first develop a system of recursive equations that describes the packet dropping...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecti...