3110 search results - page 42 / 622 » On the initialization of the DNMF algorithm |
109
click to vote
WSC
1998
15 years 5 months ago
1998
The search problem, ACCESSIBILITY, asks whether a finite sequence of events can be found such that, starting with a specific initial event, a particular state can be reached. This...
162
click to vote
PAKDD
2010
ACM
15 years 6 months ago
2010
ACM
Abstract. Finding correlation clusters in the arbitrary subspaces of highdimensional data is an important and a challenging research problem. The current state-of-the-art correlati...
121
Voted
NPL
2000
15 years 3 months ago
2000
Thispaper proposes anew version ofa method (G-Prop, geneticbackpropagation) that attempts to solve the problem of
156
click to vote
ENTCS
2002
15 years 3 months ago
2002
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We giv...
130
Voted
COLING
2008
15 years 5 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...