Sciweavers

927 search results - page 30 / 186
» A Data Abstraction Alternative to Data Structure Algorithm M...
Sort
View
SSD
1995
Springer
97views Database» more  SSD 1995»
15 years 5 months ago
Ranking in Spatial Databases
Abstract. An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatia...
Gísli R. Hjaltason, Hanan Samet
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 6 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...
KAIS
2007
75views more  KAIS 2007»
15 years 2 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
IMCSIT
2010
15 years 8 days ago
Modelling, Optimization and Execution of Workflow Applications with Data Distribution, Service Selection and Budget Constraints
Abstract--The paper proposes a model which allows integration of services published by independent providers into scientific or business workflows. Optimization algorithms are prop...
Pawel Czarnul
CG
2011
Springer
14 years 6 months ago
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
David Canino, Leila De Floriani, Kenneth Weiss