Sciweavers

1019 search results - page 8 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
13 years 9 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
WDAG
2005
Springer
118views Algorithms» more  WDAG 2005»
14 years 28 days ago
Distributed Computing with Imperfect Randomness
Randomness is a critical resource in many computational scenarios, enabling solutions where deterministic ones are elusive or even provably impossible. However, the randomized solu...
Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanatha...
ICANN
2010
Springer
13 years 7 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
NAACL
2007
13 years 9 months ago
Joint Versus Independent Phonological Feature Models within CRF Phone Recognition
We compare the effect of joint modeling of phonological features to independent feature detectors in a Conditional Random Fields framework. Joint modeling of features is achieved ...
Ilana Bromberg, Jeremy Morris, Eric Fosler-Lussier
ICASSP
2008
IEEE
14 years 1 months ago
Performance and robustness: A trade-off in dynamic signature verification
A performance and robustness study for on-line signature veri cation is presented. Experiments are carried out on the MCYT database comprising 16,500 signatures from 330 subjects,...
Javier Galbally, Julian Fiérrez, Javier Ort...