9509 search results - page 390 / 1902 » Complex Event Processing |
237
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
150
click to vote
RULES
1995
Springer
15 years 10 months ago
1995
Springer
Engineering applications that use Active DBMSs (ADBMSs) often need to group activities into modes that are shifted during the execution of different tasks. This paper presents a me...
184
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
181
click to vote
APCCM
2006
15 years 8 months ago
2006
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
225
click to vote
IJCAI
2001
15 years 8 months ago
2001
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...