Sciweavers

5623 search results - page 341 / 1125
» Estimating in Actual Time
Sort
View
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
CVPR
2009
IEEE
17 years 1 months ago
Locally Time-Invariant models of Human Activities using Trajectories on the Grassmanian
Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities...
Pavan Turaga, Rama Chellappa
CVPR
2008
IEEE
16 years 8 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
ICCV
2001
IEEE
16 years 8 months ago
Modelling Faces Dynamically across Views and Over Time
A comprehensive novel multi-view dynamic face model is presented in this paper to address two challenging problems in face recognition and facial analysis: modelling faces with la...
Yongmin Li, Shaogang Gong, Heather M. Liddell
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
16 years 8 months ago
Collecting and Maintaining Just-in-Time Statistics
Traditional DBMSs decouple statistics collection and query optimization both in space and time. Decoupling in time may lead to outdated statistics. Decoupling in space may cause s...
Amr El-Helw, Ihab F. Ilyas, Wing Lau, Volker Markl...