Sciweavers

2593 search results - page 31 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
QUESTA
2010
89views more  QUESTA 2010»
13 years 7 months ago
Asymptotically optimal importance sampling for Jackson networks with a tree topology
Consider a stable open Jackson Network with a tree topology. Customers arrive at the single root of the tree. The system is stable in the sense that the average service rate at ea...
Ali Devin Sezer
COMPGEOM
2005
ACM
13 years 10 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
VIS
2003
IEEE
234views Visualization» more  VIS 2003»
14 years 10 months ago
Saddle Connectors - An Approach to Visualizing the Topological Skeleton of Complex 3D Vector Fields
One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number...
Hans-Christian Hege, Hans-Peter Seidel, Holger The...
COMPLEX
2009
Springer
14 years 20 days ago
A Comparative Analysis of Specific Spatial Network Topological Models
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
Jun Wang, Gregory M. Provan
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
14 years 1 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena