1522 search results - page 168 / 305 » On the Complexity of Several Haplotyping Problems |
CGF
2005
14 years 10 months ago
2005
This paper addresses the problem of human motion encoding for real-time animation in interactive environments. Classically, a motion is stored as a sequence of body postures encod...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
CPM
2005
Springer
15 years 1 days ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
91
Voted
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...