Sciweavers

15485 search results - page 2547 / 3097
» Computing Optimal Subsets
Sort
View
CEC
2010
IEEE
15 years 2 months ago
Multi-objective robust static mapping of independent tasks on grids
We study the problem of efficiently allocating incoming independent tasks onto the resources of a Grid system. Typically, it is assumed that the estimated time to compute each task...
Bernabé Dorronsoro Díaz, Pascal Bouv...
COLING
2010
15 years 2 months ago
Fast-Champollion: A Fast and Robust Sentence Alignment Algorithm
Sentence-level aligned parallel texts are important resources for a number of natural language processing (NLP) tasks and applications such as statistical machine translation and ...
Peng Li, Maosong Sun, Ping Xue
NECO
2011
15 years 2 months ago
Least-Squares Independent Component Analysis
Accurately evaluating statistical independence among random variables is a key element of Independent Component Analysis (ICA). In this paper, we employ a squared-loss variant of ...
Taiji Suzuki, Masashi Sugiyama
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
15 years 2 months ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
TNN
2011
129views more  TNN 2011»
15 years 2 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
« Prev « First page 2547 / 3097 Last » Next »