817 search results - page 41 / 164 » An Optimal Linear Time Algorithm for Quasi-Monotonic Segment... |
134
click to vote
ICIAR
2004
Springer
15 years 8 months ago
2004
Springer
We propose a new fast facial-feature extraction technique for embedded face-recognition applications. A deformable feature model is adopted, of which the parameters are optimized t...
120
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
This paper deals with pipelined queries over services. The execution plan of such queries defines an order in which the services are called. We present the theoretical underpinni...
112
click to vote
MMAS
2010
Springer
14 years 10 months ago
2010
Springer
The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a non...
115
Voted
CVPR
2008
IEEE
15 years 9 months ago
2008
IEEE
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
139
click to vote
KDD
2010
ACM
15 years 7 months ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...