683 search results - page 12 / 137 » A Fine-grained Analysis of a Simple Independent Set Algorith... |
COLOGNETWENTE
2008
15 years 22 days ago
2008
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
IDA
1998
Springer
14 years 11 months ago
1998
Springer
A fast and simple algorithm for approximately calculating the principal components (PCs) of a data set and so reducing its dimensionality is described. This Simple Principal Compo...
SOFSEM
2009
Springer
15 years 8 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
167
click to vote
POPL
2005
ACM
15 years 11 months ago
2005
ACM
This paper proposes a novel approach to shape analysis: using local reasoning about individual heap locations of global reasoning about entire heap abstractions. We present an int...
105
click to vote
ICDAR
2009
IEEE
15 years 6 months ago
2009
IEEE
Handwritten document images contain textlines with multi orientations, touching and overlapping characters within consecutive textlines, and small inter-line spacing making textli...