Sciweavers

2962 search results - page 309 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
SSD
2005
Springer
153views Database» more  SSD 2005»
16 years 4 days ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
ICCV
2009
IEEE
15 years 4 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden
VLDB
1992
ACM
151views Database» more  VLDB 1992»
15 years 10 months ago
A Uniform Approach to Processing Temporal Queries
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
Umeshwar Dayal, Gene T. J. Wuu
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 4 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
ICML
2005
IEEE
16 years 7 months ago
Clustering through ranking on manifolds
Clustering aims to find useful hidden structures in data. In this paper we present a new clustering algorithm that builds upon the consistency method (Zhou, et.al., 2003), a semi-...
Markus Breitenbach, Gregory Z. Grudic