4865 search results - page 283 / 973 » The Complexity of Graph Connectivity |
157
click to vote
IJAC
2007
15 years 6 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
171
click to vote
DAS
2010
Springer
15 years 6 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...
168
click to vote
DAM
2007
15 years 6 months ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
186
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
170
click to vote
IICS
2003
Springer
15 years 12 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...