359 search results - page 49 / 72 » The Parameterized Complexity of Counting Problems |
TCS
2008
13 years 7 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
ICIP
2000
IEEE
14 years 8 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
ALGORITHMICA
2002
13 years 7 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
A support vector machine based algorithm for corner detection is presented. It is based on computing the direction of maximum gray-level change for each edge pixel in an image, an...