Sciweavers

1888 search results - page 86 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
ICDM
2006
IEEE
108views Data Mining» more  ICDM 2006»
15 years 10 months ago
Spatial Multidimensional Sequence Clustering
Measurements at different time points and positions in large temporal or spatial databases requires effective and efficient data mining techniques. For several parallel measureme...
Ira Assent, Ralph Krieger, Boris Glavic, Thomas Se...
ESA
2003
Springer
58views Algorithms» more  ESA 2003»
15 years 9 months ago
Kinetic Dictionaries: How to Shoot a Moving Target
A kinetic dictionary is a data structure for storing a set S of continuously moving points on the real line, such that at any time we can quickly determine for a given query point ...
Mark de Berg
DKE
2002
113views more  DKE 2002»
15 years 4 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
GCB
2000
Springer
99views Biometrics» more  GCB 2000»
15 years 8 months ago
Structure Motif Discovery and Mining the PDB
We describe an algorithm for the automatic discovery of recurring patterns in protein structures. The patterns consist of individual residues having a defined order along the prote...
Inge Jonassen, Ingvar Eidhammer, Darrell Conklin, ...
SIAMSC
2011
85views more  SIAMSC 2011»
14 years 7 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss