Sciweavers

1522 search results - page 164 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
FGR
2011
IEEE
227views Biometrics» more  FGR 2011»
14 years 1 months ago
Warp that smile on your face: Optimal and smooth deformations for face recognition
— In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is consid...
Tobias Gass, Leonid Pishchulin, Philippe Dreuw, He...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
15 years 10 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
GECCO
2003
Springer
189views Optimization» more  GECCO 2003»
15 years 3 months ago
A Forest Representation for Evolutionary Algorithms Applied to Network Design
Abstract. Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some example...
Alexandre C. B. Delbem, André Carlos Ponce ...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 2 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
ICCV
2007
IEEE
16 years 8 hour ago
Coplanar Shadowgrams for Acquiring Visual Hulls of Intricate Objects
Acquiring 3D models of intricate objects (like tree branches, bicycles and insects) is a hard problem due to severe self-occlusions, repeated thin structures and surface discontin...
Shuntaro Yamazaki, Srinivasa G. Narasimhan, Simon ...