Sciweavers

2962 search results - page 28 / 593
» Optimizing Spatial Data Structures For Static Data
Sort
View
BIBE
2009
IEEE
161views Bioinformatics» more  BIBE 2009»
14 years 2 months ago
Soft Tissue Deformation and Optimized Data Structures for Mass Spring Methods
One of the essential components of a virtual reality surgical simulation is deformation. Deformations in computer graphics and surgical simulations are commonly modeled with three...
Tansel Halic, Sinan Kockara, Coskun Bayrak, Richar...
STACS
2010
Springer
14 years 23 days ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
Neelesh Khanna, Surender Baswana
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 7 months ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 26 days ago
Spatial Operators for Evolving Dynamic Bayesian Networks from Spatio-temporal Data
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
Allan Tucker, Xiaohui Liu, David Garway-Heath
GI
2008
Springer
13 years 8 months ago
A Novel Conceptual Model for Accessing Distributed Data and Applications, as well as Devices
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
Lucia Terrenghi, Thomas Lang