2583 search results - page 227 / 517 » On the Representation of Timed Polyhedra |
181
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...
227
click to vote
TKDE
2012
13 years 9 months ago
2012
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
231
click to vote
AAAI
2012
13 years 9 months ago
2012
Real-world AI systems have been recently deployed which can automatically analyze the plan and tactics of tennis players. As the game-state is updated regularly at short intervals...
202
click to vote
PETRA
2009
ACM
16 years 1 months ago
2009
ACM
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
184
click to vote
COMPGEOM
2006
ACM
16 years 15 days ago
2006
ACM
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...