Sciweavers

2191 search results - page 344 / 439
» Improving the Efficiency of Non-Deterministic Computations
Sort
View
ICCV
2003
IEEE
14 years 11 months ago
A Sparse Probabilistic Learning Algorithm for Real-Time Tracking
This paper addresses the problem of applying powerful pattern recognition algorithms based on kernels to efficient visual tracking. Recently Avidan [1] has shown that object recog...
Oliver M. C. Williams, Andrew Blake, Roberto Cipol...
ECCV
2004
Springer
14 years 11 months ago
An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets
Abstract. We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or be...
Zia Khan, Tucker R. Balch, Frank Dellaert
WWW
2002
ACM
14 years 10 months ago
Learning to map between ontologies on the semantic web
Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated info...
AnHai Doan, Jayant Madhavan, Pedro Domingos, Alon ...
SIGMOD
2008
ACM
236views Database» more  SIGMOD 2008»
14 years 9 months ago
Approximate embedding-based subsequence matching of time series
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
Vassilis Athitsos, Panagiotis Papapetrou, Michalis...
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
14 years 9 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han