Sciweavers

229 search results - page 31 / 46
» Dynamic Algorithms for Recoverable Robustness Problems
Sort
View
ICPR
2004
IEEE
14 years 7 months ago
Simplest Representation Yet for Gait Recognition: Averaged Silhouette
We present a robust representation for gait recognition that is compact, easy to construct, and affords efficient matching. Instead of a time series based representation comprisin...
Sudeep Sarkar, Zongyi Liu
ICML
2010
IEEE
13 years 7 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
VLDB
2001
ACM
90views Database» more  VLDB 2001»
13 years 11 months ago
Update Propagation Strategies for Improving the Quality of Data on the Web
Dynamically generated web pages are ubiquitous today but their high demand for resources creates a huge scalability problem at the servers. Traditional web caching is not able to ...
Alexandros Labrinidis, Nick Roussopoulos
AVSS
2006
IEEE
14 years 24 days ago
A Smith-Waterman Local Alignment Approach for Spatial Activity Recognition
In this paper we address the spatial activity recognition problem with an algorithm based on Smith-Waterman (SW) local alignment. The proposed SW approach utilises dynamic program...
Daniel E. Riedel, Svetha Venkatesh, Wanquan Liu
TASLP
2008
75views more  TASLP 2008»
13 years 6 months ago
Efficient Index-Based Audio Matching
Given a large audio database of music recordings, the goal of classical audio identification is to identify a particular audio recording by means of a short audio fragment. Even th...
Frank Kurth, Meinard Müller