54 search results - page 10 / 11 » The Complexity of Perfect Matching Problems on Dense Hypergr... |
DAM
2007
13 years 8 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
Recovering the three-dimensional (3D) object shape lies as an unresolved and active research topic on the crosssection of computer vision, photogrammetry and bioinformatics. Altho...
SIGGRAPH
1999
ACM
14 years 25 days ago
1999
ACM
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly throu...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
ICA
2012
Springer
12 years 4 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...