Sciweavers

893 search results - page 16 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Artificial bandwidth extension of spectral envelope with temporal clustering
We present a new wideband spectral envelope estimation framework for the artificial bandwidth extension problem. The proposed framework builds temporal clusters of the joint sub-...
Can Yagli, Engin Erzin
FGR
2011
IEEE
247views Biometrics» more  FGR 2011»
12 years 11 months ago
Segment and recognize expression phase by fusion of motion area and neutral divergence features
—An expression can be approximated by a sequence of temporal segments called neutral, onset, offset and apex. However, it is not easy to accurately detect such temporal segments ...
Shizhi Chen, YingLi Tian, Qingshan Liu, Dimitris N...
JIIS
2006
103views more  JIIS 2006»
13 years 7 months ago
Time-focused clustering of trajectories of moving objects
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and social/commercial reasons. From the data mining vie...
Mirco Nanni, Dino Pedreschi
LWA
2004
13 years 9 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping
COLOGNETWENTE
2008
13 years 9 months ago
A Simple 3-Approximation of Minimum Manhattan Networks
Given a set P of n points in the plane, a Manhattan network of P is a network that contains a rectilinear shortest path between every pair of points of P. A minimum Manhattan netw...
Bernhard Fuchs, Anna Schulze