Sciweavers

2657 search results - page 222 / 532
» On the complexity of hierarchical problem solving
Sort
View
VLDB
1997
ACM
175views Database» more  VLDB 1997»
15 years 6 months ago
STING: A Statistical Information Grid Approach to Spatial Data Mining
Spatial data mining, i.e., discovery of interesting characteristics and patterns that may implicitly exist in spatial databases, is a challenging task due to the huge amounts of s...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
COMPGEOM
2005
ACM
15 years 3 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
COMPGEOM
2008
ACM
15 years 3 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
BMCBI
2006
164views more  BMCBI 2006»
15 years 1 months ago
BIOZON: a system for unification, management and analysis of heterogeneous biological data
Integration of heterogeneous data types is a challenging problem, especially in biology, where the number of databases and data types increase rapidly. Amongst the problems that o...
Aaron Birkland, Golan Yona
CSL
2009
Springer
15 years 8 months ago
Model Checking FO(R) over One-Counter Processes and beyond
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
Anthony Widjaja To