Sciweavers

679 search results - page 52 / 136
» Molecular structure determination on a computational and dat...
Sort
View
125
Voted
GRID
2006
Springer
15 years 19 days ago
Applying Peer-to-Peer Techniques to Grid Replica Location Services
Peer-to-peer systems offer attractive system management properties, including the ability of components that join the network to self-organize; scalability up to tens of thousands...
Ann L. Chervenak, Min Cai
86
Voted
CGF
2002
116views more  CGF 2002»
15 years 13 days ago
Deferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
Sigal Ar, Gil Montag, Ayellet Tal
115
Voted
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 8 days ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky
CG
2008
Springer
15 years 22 days ago
Parallel reflective symmetry transformation for volume data
Many volume data possess symmetric features that can be clearly observed, for example, those existing in diffusion tensor image data sets. The exploitations of symmetries for volu...
Yuan Hong, Han-Wei Shen
99
Voted
STOC
2003
ACM
133views Algorithms» more  STOC 2003»
16 years 28 days ago
A fast algorithm for computing steiner edge connectivity
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
Richard Cole, Ramesh Hariharan