Sciweavers

2004 search results - page 350 / 401
» Sampling from large graphs
Sort
View
126
Voted
ML
2006
ACM
15 years 2 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
148
Voted
TITS
2011
165views more  TITS 2011»
14 years 9 months ago
Robust Inference of Principal Road Paths for Intelligent Transportation Systems
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
Gabriel Agamennoni, Juan Nieto, Eduardo Mario Nebo...
139
Voted
CVPR
2012
IEEE
13 years 4 months ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
116
Voted
CSL
2010
Springer
15 years 2 months ago
Discriminative training of HMMs for automatic speech recognition: A survey
Recently, discriminative training (DT) methods have achieved tremendous progress in automatic speech recognition (ASR). In this survey article, all mainstream DT methods in speech...
Hui Jiang
STACS
2007
Springer
15 years 8 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom