234 search results - page 1 / 47 » Isolation, Matching, and Counting |
COCO
1998
Springer
14 years 3 months ago
1998
Springer
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...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
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...
ANTS
2008
Springer
14 years 26 days ago
2008
Springer
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.
DAMON
2009
Springer
14 years 5 months ago
2009
Springer
Database engines face growing scalability challenges as core counts exponentially increase each processor generation, and the efficiency of synchronization primitives used to prot...
WCE
2007
14 years 5 hour ago
2007
— 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...