121 search results - page 9 / 25 » Improving branch-and-cut performance by random sampling |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—Anomaly detection methods typically operate on pre-processed, i.e., sampled and aggregated, traffic traces. Most traffic capturing devices today employ random packet sampling,...
IEEEPACT
2005
IEEE
15 years 4 months ago
2005
IEEE
This paper presents a new technique for efficient usage of small trace caches. A trace cache can significantly increase the performance of wide out-oforder processors, but to be e...
110
click to vote
SIGMETRICS
2011
ACM
14 years 1 months ago
2011
ACM
The massive data streams observed in network monitoring, data processing and scientific studies are typically too large to store. For many applications over such data, we must ob...
103
click to vote
CGF
2011
14 years 2 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...