1322 search results - page 71 / 265 » Parameterized counting problems |
110
Voted
ICFEM
2000
Springer
15 years 6 months 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 ...
136
Voted
CVPR
2006
IEEE
16 years 4 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...
201
click to vote
ICDE
2001
IEEE
16 years 4 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...
150
Voted
ICDCS
2010
IEEE
15 years 4 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...
112
Voted
CORR
2006
Springer
15 years 2 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 ...