Sciweavers

1466 search results - page 129 / 294
» Complexity of Reasoning over Temporal Data Models
Sort
View
IDA
2002
Springer
15 years 4 months ago
Online classification of nonstationary data streams
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
Mark Last
NIPS
2004
15 years 6 months ago
Euclidean Embedding of Co-Occurrence Data
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
AIPS
2003
15 years 6 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
GIS
2007
ACM
16 years 5 months ago
A model for enriching trajectories with semantic geographical information
The collection of moving object data is becoming more and more common, and therefore there is an increasing need for the efficient analysis and knowledge extraction of these data ...
Alejandro A. Vaisman, Bart Kuijpers, Bart Moelans,...
ACSC
2003
IEEE
15 years 10 months ago
A Unifying Semantic Distance Model for Determining the Similarity of Attribute Values
The relative difference between two data values is of interest in a number of application domains including temporal and spatial applications, schema versioning, data warehousing...
John F. Roddick, Kathleen Hornsby, Denise de Vries