Sciweavers

1346 search results - page 14 / 270
» On the number of rectangular partitions
Sort
View
GD
2004
Springer
14 years 3 days ago
Layouts of Graph Subdivisions
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...
Vida Dujmovic, David R. Wood
SIGMOD
2012
ACM
253views Database» more  SIGMOD 2012»
11 years 9 months ago
Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
The advent of affordable, shared-nothing computing systems portends a new class of parallel database management systems (DBMS) for on-line transaction processing (OLTP) applicatio...
Andrew Pavlo, Carlo Curino, Stanley B. Zdonik
FUZZIEEE
2007
IEEE
14 years 1 months ago
Adaptive Optimization of the Number of Clusters in Fuzzy Clustering
In this paper, we present a local, adaptive optimization scheme for adjusting the number of clusters in fuzzy C-means clustering. This method is especially motivated by online app...
Jürgen Beringer, Eyke Hüllermeier
SIGMOD
1999
ACM
125views Database» more  SIGMOD 1999»
13 years 11 months ago
Selectivity Estimation in Spatial Databases
Selectivity estimation of queries is an important and wellstudied problem in relational database systems. In this paper, we examine selectivity estimation in the context of Geogra...
Swarup Acharya, Viswanath Poosala, Sridhar Ramaswa...
DAM
2006
116views more  DAM 2006»
13 years 6 months ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...