10051 search results - page 292 / 2011 » A Dynamic Separator Algorithm |
153
click to vote
DAGSTUHL
2001
15 years 8 months ago
2001
Visualization of an algorithm offers only a rough picture of operations. Explanations are crucial for deeper understanding, because they help the viewer to associate the visualiza...
182
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Hidden Markov Models (HMMs) are one of the most fundamental and widely used statistical tools for modeling discrete time series. In general, learning HMMs from data is computation...
201
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
197
click to vote
TIP
2008
15 years 6 months ago
2008
Abstract--In this paper, we present a complete and practical algorithm for the approximation of level-set-based curve evolution suitable for real-time implementation. In particular...
172
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, an optimized approximation algorithm (OAA) is proposed to address the overfitting problem in function approximation using neural networks (NNs). The optimized approx...