Sciweavers

234 search results - page 1 / 47
» Isolation, Matching, and Counting
Sort
View
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
13 years 9 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
ICASSP
2010
IEEE
13 years 5 months ago
Matching canvas weave patterns from processing x-ray images of master paintings
Thread counting algorithms seek to determine from x-ray images the vertical and horizontal thread counts (frequencies) of the canvas weave comprising a painting’s support. Our s...
Don H. Johnson, Lucia Sun, C. Richard Johnson Jr.,...
ANTS
2008
Springer
99views Algorithms» more  ANTS 2008»
13 years 6 months ago
Point Counting on Singular Hypersurfaces
We discuss how one can extend to hypersurfaces with isolated singularities the methods of Gerkmann, Abbott-Kedlaya-Roe and Lauder for counting points on smooth hypersurfaces.
Remke Kloosterman
DAMON
2009
Springer
13 years 11 months ago
A new look at the roles of spinning and blocking
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
Ryan Johnson, Manos Athanassoulis, Radu Stoica, An...
WCE
2007
13 years 6 months ago
Wavepackets in the Recognition of Isolated Handwritten Characters
— This work is to apply wavelet packet transformation for the recognition of isolated handwritten Malayalam (one of the south Indian languages) characters. The key idea is that c...
G. Raju, K. Revathy