Sciweavers

4403 search results - page 639 / 881
» Galois Theory of Algorithms
Sort
View
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
15 years 11 months ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 11 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 11 months ago
A framework for specifying explicit bias for revision of approximate information extraction rules
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...
Ronen Feldman, Yair Liberzon, Binyamin Rosenfeld, ...
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 10 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
CVPR
2010
IEEE
15 years 9 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai