Sciweavers

683 search results - page 12 / 137
» A Fine-grained Analysis of a Simple Independent Set Algorith...
Sort
View
129
Voted
COLOGNETWENTE
2008
15 years 4 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
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...
Bernhard Fuchs, Anna Schulze
IDA
1998
Springer
15 years 3 months ago
Fast Dimensionality Reduction and Simple PCA
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...
Matthew Partridge, Rafael A. Calvo
SOFSEM
2009
Springer
16 years 6 days ago
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
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...
Martin Dietzfelbinger, Ulf Schellbach
POPL
2005
ACM
16 years 3 months ago
Region-based shape analysis with tracked locations
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...
Brian Hackett, Radu Rugina
ICDAR
2009
IEEE
15 years 10 months ago
Script-Independent Handwritten Textlines Segmentation Using Active Contours
Handwritten document images contain textlines with multi orientations, touching and overlapping characters within consecutive textlines, and small inter-line spacing making textli...
Syed Saqib Bukhari, Faisal Shafait, Thomas M. Breu...