1456 search results - page 43 / 292 » Improved Randomized Results for That Interval Selection Prob... |
MSS
2003
IEEE
15 years 3 months ago
2003
IEEE
Existing file access predictors keep track of previous file access patterns and rely on a single heuristic to predict which of the previous successors to the file being currently ...
EMNLP
2009
14 years 7 months ago
2009
Machine involvement has the potential to speed up language documentation. We assess this potential with timed annotation experiments that consider annotator expertise, example sel...
INFOCOM
2010
IEEE
14 years 8 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,...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...