2634 search results - page 188 / 527 » Faster Than Uppaal |
162
click to vote
NETWORKS
2008
15 years 6 months ago
2008
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
120
click to vote
SIAMSC
2008
15 years 6 months ago
2008
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
159
click to vote
LATA
2010
Springer
16 years 3 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
164
click to vote
TCS
2008
15 years 6 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
159
click to vote
TKDE
2008
15 years 6 months ago
2008
This paper introduces a new method for supervised discretization based on interval distances by using a novel concept of neighborhood in the target's space. The proposed metho...