1322 search results - page 71 / 265 » Parameterized counting problems |
ICFEM
2000
Springer
14 years 13 days ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
CVPR
2006
IEEE
14 years 11 months ago
2006
IEEE
In its full generality, motion analysis of crowded objects necessitates recognition and segmentation of each moving entity. The difficulty of these tasks increases considerably wi...
ICDE
2001
IEEE
14 years 10 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
ICDCS
2010
IEEE
13 years 10 months ago
2010
IEEE
The growing importance of operations such as identification, location sensing and object tracking has led to increasing interests in contactless Radio Frequency Identification (RFI...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...