Sciweavers

822 search results - page 136 / 165
» Hashing Methods for Temporal Data
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 17 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
IPPS
1998
IEEE
13 years 12 months ago
Locality Optimization for Program Instances
Abstract. The degree of locality of a program re ects the level of temporal and spatial concentration of related data and computations. Locality optimization can speed up programs ...
Claudia Leopold
3DPVT
2004
IEEE
177views Visualization» more  3DPVT 2004»
13 years 11 months ago
Seeing into the Past: Creating a 3D Modeling Pipeline for Archaeological Visualization
Archaeology is a destructive process in which accurate and detailed recording of a site is imperative. As a site is exposed, documentation is required in order to recreate and und...
Peter K. Allen, Steven Feiner, Alejandro Troccoli,...
AAAI
2008
13 years 10 months ago
Feature Selection for Activity Recognition in Multi-Robot Domains
In multi-robot settings, activity recognition allows a robot to respond intelligently to the other robots in its environment. Conditional random fields are temporal models that ar...
Douglas L. Vail, Manuela M. Veloso
TNN
2008
132views more  TNN 2008»
13 years 7 months ago
Just-in-Time Adaptive Classifiers - Part I: Detecting Nonstationary Changes
Abstract--The stationarity requirement for the process generating the data is a common assumption in classifiers' design. When such hypothesis does not hold, e.g., in applicat...
Cesare Alippi, Manuel Roveri