Sciweavers

600 search results - page 30 / 120
» Problems and results in extremal combinatorics - II
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Face Reconstruction in the Wild
We address the problem of reconstructing 3D face models from large unstructured photo collections, e.g., obtained by Google image search or from personal photo collections in iPho...
Ira Kemelmacher-Shlizerman, Steven Seitz
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 10 months ago
Hardness of Optimal Spaced Seed Design
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,...
François Nicolas, Eric Rivals
CPM
2007
Springer
102views Combinatorics» more  CPM 2007»
14 years 2 months ago
Non-breaking Similarity of Genomes with Gene Repetitions
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
Zhixiang Chen, Bin Fu, Jinhui Xu, Bo-Ting Yang, Zh...
COMPGEOM
2009
ACM
14 years 2 months ago
Zigzag persistent homology and real-valued functions
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
Gunnar Carlsson, Vin de Silva, Dmitriy Morozov
COCOON
2006
Springer
13 years 11 months ago
Reconstructing Evolution of Natural Languages: Complexity and Parameterized Algorithms
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
Iyad A. Kanj, Luay Nakhleh, Ge Xia