Sciweavers

16430 search results - page 805 / 3286
» On Computable Tree Functions
Sort
View
IPPS
1997
IEEE
15 years 11 months ago
Maintaining Spatial Data Sets in Distributed-Memory Machines
We propose a distributed data structure for maintaining spatial data sets on message-passing, distributed memory machines. The data structure is based on orthogonal bisection tree...
Susanne E. Hambrusch, Ashfaq A. Khokhar
SIGGRAPH
1996
ACM
15 years 11 months ago
Visual Models of Plants Interacting with Their Environment
Interaction with the environment is a key factor affecting the development of plants and plant ecosystems. In this paper we introduce a modeling framework that makes it possible t...
Radomír Mech, Przemyslaw Prusinkiewicz
SODA
1994
ACM
138views Algorithms» more  SODA 1994»
15 years 8 months ago
Average Case Analysis of Dynamic Geometric Optimization
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
David Eppstein
LPAR
2010
Springer
15 years 6 months ago
Partitioning SAT Instances for Distributed Solving
Abstract. In this paper we study the problem of solving hard propositional satisfiability problem (SAT) instances in a computing grid or cloud, where run times and communication b...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
CCA
2009
Springer
16 years 2 months ago
Computability of Homology for Compact Absolute Neighbourhood Retracts
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
Pieter Collins