Sciweavers

3365 search results - page 156 / 673
» Multidimensional Data Modeling for Complex Data
Sort
View
ICML
2006
IEEE
16 years 7 months ago
Combining discriminative features to infer complex trajectories
We propose a new model for the probabilistic estimation of continuous state variables from a sequence of observations, such as tracking the position of an object in video. This ma...
David A. Ross, Simon Osindero, Richard S. Zemel
FOIKS
2008
Springer
15 years 8 months ago
Lossless Decompositions in Complex-Valued Databases
When decomposing database schemas, it is desirable that a decomposition is lossless and dependency preserving. A well-known and frequently used result for the relational model stat...
Henning Köhler, Sebastian Link
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 10 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
ICECCS
1995
IEEE
100views Hardware» more  ICECCS 1995»
15 years 10 months ago
POSD-a notation for presenting complex systems of processes
When trying to describe the behaviour of large systems, such as the business processes of large enterprises, we often adopt diagramming techniques based on derivatives of data flo...
Peter Henderson, Graham D. Pratten
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
13 years 8 months ago
The cell probe complexity of dynamic range counting
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
Kasper Green Larsen