111 search results - page 14 / 23 » Randomized computations on large data sets: tight lower boun... |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
JPDC
2008
13 years 7 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...
DATAMINE
2006
13 years 7 months ago
2006
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
CIKM
2011
Springer
12 years 7 months ago
2011
Springer
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...