Sciweavers

2100 search results - page 191 / 420
» Fundamentals of the problem
Sort
View
MICCAI
2007
Springer
16 years 1 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
112
Voted
ICML
2005
IEEE
16 years 1 months ago
Linear Asymmetric Classifier for cascade detectors
The detection of faces in images is fundamentally a rare event detection problem. Cascade classifiers provide an efficient computational solution, by leveraging the asymmetry in t...
Jianxin Wu, Matthew D. Mullin, James M. Rehg
100
Voted
RECOMB
2009
Springer
16 years 1 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of tw...
Tetsuo Shibuya
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
16 years 1 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
101
Voted
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 16 days ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan