Sciweavers

662 search results - page 16 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
CVIU
2011
13 years 2 months ago
Action recognition with appearance-motion features and fast search trees
In this paper we propose an approach for action recognition based on a vocabulary of local motion-appearance features and fast approximate search in a large number of trees. Large...
Krystian Mikolajczyk, Hirofumi Uemura
VLDB
2005
ACM
109views Database» more  VLDB 2005»
14 years 8 months ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
TKDE
2008
133views more  TKDE 2008»
13 years 7 months ago
Streaming Time Series Summarization Using User-Defined Amnesic Functions
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractica...
Themis Palpanas, Michail Vlachos, Eamonn J. Keogh,...
DCC
2010
IEEE
14 years 2 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 5 months ago
Maintaining a Large Matching or a Small Vertex Cover
We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge ins...
Krzysztof Onak and Ronitt Rubinfeld