Sciweavers

384 search results - page 76 / 77
» Learning Markov Network Structure with Decision Trees
Sort
View
JMLR
2008
148views more  JMLR 2008»
13 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
JMLR
2008
129views more  JMLR 2008»
13 years 6 months ago
Finite-Time Bounds for Fitted Value Iteration
In this paper we develop a theoretical analysis of the performance of sampling-based fitted value iteration (FVI) to solve infinite state-space, discounted-reward Markovian decisi...
Rémi Munos, Csaba Szepesvári
SIGSOFT
2009
ACM
14 years 7 months ago
Improving bug triage with bug tossing graphs
A bug report is typically assigned to a single developer who is then responsible for fixing the bug. In Mozilla and Eclipse, between 37%-44% of bug reports are "tossed" ...
Gaeul Jeong, Sunghun Kim, Thomas Zimmermann
TSMC
1998
91views more  TSMC 1998»
13 years 6 months ago
Toward the border between neural and Markovian paradigms
— A new tendency in the design of modern signal processing methods is the creation of hybrid algorithms. This paper gives an overview of different signal processing algorithms si...
Piotr Wilinski, Basel Solaiman, A. Hillion, W. Cza...
TNN
1998
121views more  TNN 1998»
13 years 6 months ago
Detection of mines and minelike targets using principal component and neural-network methods
— This paper introduces a new system for real-time detection and classification of arbitrarily scattered surface-laid mines from multispectral imagery data of a minefield. The ...
Xi Miao, Mahmood R. Azimi-Sadjadi, Bin Tan, A. C. ...