Sciweavers

6274 search results - page 149 / 1255
» From query complexity to computational complexity
Sort
View
ECCV
2010
Springer
15 years 7 months ago
Modeling Temporal Structure of Decomposable Motion Segments for Activity Classification
Abstract. Much recent research in human activity recognition has focused on the problem of recognizing simple repetitive (walking, running, waving) and punctual actions (sitting up...
153
Voted
GRID
2003
Springer
15 years 9 months ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
PVLDB
2010
134views more  PVLDB 2010»
15 years 2 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
CANS
2006
Springer
90views Cryptology» more  CANS 2006»
15 years 7 months ago
Shorter Verifier-Local Revocation Group Signatures from Bilinear Maps
We propose a new computational complexity assumption from bilinear map, based on which we construct Verifier-Local Revocation group signatures with shorter lengths than previous on...
Sujing Zhou, Dongdai Lin
ECML
2006
Springer
15 years 7 months ago
Ensembles of Nearest Neighbor Forecasts
Nearest neighbor forecasting models are attractive with their simplicity and the ability to predict complex nonlinear behavior. They rely on the assumption that observations simila...
Dragomir Yankov, Dennis DeCoste, Eamonn J. Keogh