Sciweavers

2485 search results - page 492 / 497
» Time Bounded Frequency Computations
Sort
View
COMPGEOM
2010
ACM
14 years 22 days ago
A kinetic triangulation scheme for moving points in the plane
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...
Haim Kaplan, Natan Rubin, Micha Sharir
KR
2010
Springer
14 years 13 days ago
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2
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...
Magdalena Ortiz, Sebastian Rudolph, Mantas Simkus
CDC
2009
IEEE
185views Control Systems» more  CDC 2009»
14 years 11 days ago
Discrete Empirical Interpolation for nonlinear model reduction
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
Saifon Chaturantabut, Danny C. Sorensen
DIGITALCITIES
2001
Springer
14 years 4 days ago
Little Boxes, Glocalization, and Networked Individualism
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 ...
Barry Wellman
LICS
2000
IEEE
14 years 1 days ago
Concurrent Omega-Regular Games
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 ...
Luca de Alfaro, Thomas A. Henzinger