1201 search results - page 25 / 241 » Linear Probing and Graphs |
ICDAR
2009
IEEE
13 years 7 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
ALENEX
2007
13 years 11 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We define an algorithm for determining, in a linear number of symbolic steps, the biconnected components of a graph implicitly represented with Ordered Binary Decision D...
ICML
2009
IEEE
14 years 10 months ago
2009
IEEE
COCO
2001
Springer
14 years 2 months ago
2001
Springer
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...