Sciweavers

1552 search results - page 266 / 311
» On the Complexity of Constant Propagation
Sort
View
COMPGEOM
2010
ACM
15 years 4 months 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
COMPGEOM
2010
ACM
15 years 4 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ICRE
2000
IEEE
15 years 4 months ago
Scenario Evolution: A Closer View on Relationships
In this article we show the results of an extensive research on scenario evolution. We investigated twelve case studies spanning over 200 scenarios that contained over 800 episode...
Karin Breitman, Julio Cesar Sampaio do Prado Leite
CONTEXT
1999
Springer
15 years 4 months ago
The Pragmatic Roots of Context
When modelling complex systems one can not include all the causal factors, but one has to settle for partial models. This is alright if the factors left out are either so constant...
Bruce Edmonds
WAN
1998
Springer
15 years 4 months ago
The NRW Metacomputing Initiative
In this paper the Northrhine-Westphalian metacomputing initiative is described. We start by discussing various general aspects of metacomputing and explain the reasons for founding...
Uwe Schwiegelshohn, Ramin Yahyapour