4378 search results - page 291 / 876 » On the Complexity of Ordered Colourings |
164
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
187
click to vote
GISCIENCE
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
171
click to vote
DAS
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we propose a method based on the skeletonization operation for multi-oriented video text detection. The first step uses our existing Laplacian-based method to ident...
159
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. For Paradigm models, evolution is just-in-time specified coordination conducted by a special reusable component McPal. Evolution can be treated consistently and on-the-fl...
138
click to vote
TSP
2008
15 years 6 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...