Sciweavers

6769 search results - page 1252 / 1354
» A new concept of robustness
Sort
View
RECOMB
1999
Springer
14 years 1 months ago
Fast detection of common geometric substructure in proteins
We consider the problem of identifying common three-dimensional substructures between proteins. Our method is based on comparing the shape of the α-carbon backbone structures of ...
L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem,...
SSD
1999
Springer
106views Database» more  SSD 1999»
14 years 1 months ago
XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension
There is an increasing need to integrate spatial index structures into commercial database management systems. In geographic information systems (GIS), huge amounts of information ...
Christian Böhm, Gerald Klump, Hans-Peter Krie...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
14 years 1 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
SIGGRAPH
1992
ACM
14 years 27 days ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
« Prev « First page 1252 / 1354 Last » Next »