Sciweavers

96 search results - page 9 / 20
» Structure and linear time recognition of 3-leaf powers
Sort
View
97
Voted
CVPR
2010
IEEE
15 years 23 days ago
Discriminative K-SVD for Dictionary Learning in Face Recognition
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while...
Qiang Zhang, Baoxin Li
BMCBI
2006
111views more  BMCBI 2006»
14 years 9 months ago
High throughput profile-profile based fold recognition for the entire human proteome
Background: In order to maintain the most comprehensive structural annotation databases we must carry out regular updates for each proteome using the latest profile-profile fold r...
Liam J. McGuffin, Richard T. Smith, Kevin Bryson, ...
IBPRIA
2007
Springer
15 years 3 months ago
Extracting Average Shapes from Occluded Non-rigid Motion
This paper presents a method to efficiently estimate average 3-D shapes from non-rigid motion in the case of missing data. Such a shape can be further used to accomplish full reco...
Alessio Del Bue
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 9 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
NJC
2000
169views more  NJC 2000»
14 years 9 months ago
A Type System for Bounded Space and Functional In-Place Update
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
Martin Hofmann