1158 search results - page 73 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
164
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
119
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
158
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Statistical density estimation techniques are used in many computer vision applications such as object tracking, background subtraction, motion estimation and segmentation. The pa...
132
Voted
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
The problemof structurefrom motion (SFM)is to extract the three-dimensionalmodel of a moving scene from a sequence of images. Though two images are sufficient to produce a 3D reco...
175
click to vote
FSTTCS
1993
Springer
15 years 8 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...