Sciweavers

200 search results - page 35 / 40
» Approximation Algorithms for Scheduling on Multiple Machines
Sort
View
147
Voted
GRID
2006
Springer
15 years 2 months ago
Snapshot Processing in Streaming Environments
Monitoring and correlation of streaming data from multiple sources is becoming increasingly important in many application areas. Example applications include automated commodities...
Daniel M. Zimmerman, K. Mani Chandy
181
Voted
ICALP
2011
Springer
14 years 6 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
157
Voted
ICML
2010
IEEE
15 years 3 months ago
Submodular Dictionary Selection for Sparse Representation
We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse,...
Andreas Krause, Volkan Cevher
106
Voted
IEEECIT
2010
IEEE
15 years 1 months ago
A Recognizer of Rational Trace Languages
—The relevance of instruction parallelization and optimal event scheduling is currently increasing. In particular, because of the high amount of computational power available tod...
Federico Maggi
116
Voted
EMNLP
2008
15 years 4 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney