6274 search results - page 502 / 1255 » From query complexity to computational complexity |
165
click to vote
SAS
2001
Springer
15 years 11 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
218
click to vote
AAAI
1998
15 years 8 months ago
1998
We present a novel methodology for building humanlike artificially intelligent systems. We take as a model the only existing systems which are universally accepted as intelligent:...
196
click to vote
GISCIENCE
2008
Springer
15 years 8 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...
177
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...
173
click to vote
MP
2008
15 years 7 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...