2485 search results - page 492 / 497 » Time Bounded Frequency Computations |
100
click to vote
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
115
click to vote
KR
2010
Springer
15 years 4 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
DIGITALCITIES
2001
Springer
15 years 4 months ago
2001
Springer
Much thinking about digital cities is in terms of community groups. Yet, the world is composed of social networks and not of groups. This paper traces how communities have changed ...
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...