Sciweavers

735 search results - page 45 / 147
» Randomization in Parallel Stringology
Sort
View
124
Voted
COCOA
2008
Springer
15 years 4 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
CORR
2008
Springer
132views Education» more  CORR 2008»
15 years 2 months ago
Betweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
Shiva Kintali
IJON
2000
62views more  IJON 2000»
15 years 2 months ago
A large-scale model of the cerebellar cortex using PGENESIS
In an investigation into the transformation of mossy ber input to Purkinje cell output in the cerebellar cortex, we have developed a network model including a sophisticated compar...
F. W. Howell, Jonas Dyhrfjeld-Johnsen, Reinoud Mae...
ECCV
2010
Springer
15 years 2 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
IOR
2008
91views more  IOR 2008»
15 years 2 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...