Sciweavers

829 search results - page 71 / 166
» Bandit Algorithms for Tree Search
Sort
View
ICML
2005
IEEE
15 years 10 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
ISCAS
2006
IEEE
116views Hardware» more  ISCAS 2006»
15 years 3 months ago
Wavelet based detection of moving tree branches and leaves in video
—A method for detection of tree branches and leaves in video is proposed. It is observed that the motion vectors of tree branches and leaves exhibit random motion. On the other h...
B. Ugur Töreyin, A. Enis Çetin
SAC
2004
ACM
15 years 3 months ago
Frequent free tree discovery in graph data
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
Ulrich Rückert, Stefan Kramer
GI
1997
Springer
15 years 1 months ago
Architecture and Search Organization for Large Vocabulary Continuous Speech Recognition
This paper gives an overview of an architecture and search organization for large vocabulary, continuous speech recognition (LVCSR at RWTH). In the rst part of the paper, we descri...
Stefan Ortmanns, Lutz Welling, Klaus Beulen, Frank...
AAAI
1994
14 years 11 months ago
Evolving Neural Networks to Focus Minimax Search
Neural networks were evolved through genetic algorithms to focus minimax search in the game of Othello. At each level of the search tree, the focus networks decide which moves are...
David E. Moriarty, Risto Miikkulainen