Sciweavers

1027 search results - page 68 / 206
» Ordered Vertex Partitioning
Sort
View
GD
2008
Springer
13 years 11 months ago
An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
J. Joseph Fowler, Carsten Gutwenger, Michael J&uum...
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
13 years 10 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
EVOW
2005
Springer
14 years 3 months ago
Order Preserving Clustering over Multiple Time Course Experiments
Abstract. Clustering still represents the most commonly used technique to analyze gene expression data—be it classical clustering approaches that aim at finding biologically rel...
Stefan Bleuler, Eckart Zitzler
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
SIGMOD
2005
ACM
145views Database» more  SIGMOD 2005»
14 years 10 months ago
Stratified Computation of Skylines with Partially-Ordered Domains
In this paper, we study the evaluation of skyline queries with partially-ordered attributes. Because such attributes lack a total ordering, traditional index-based evaluation algo...
Chee Yong Chan, Pin-Kwang Eng, Kian-Lee Tan