Sciweavers

320 search results - page 16 / 64
» Overlapping cluster planarity
Sort
View
WSCG
2003
228views more  WSCG 2003»
15 years 1 months ago
The Escritoire: A Personal Projected Display
The Escritoire is a horizontal desk surface that uses two overlapping digital projectors to create a foveal display – a large interactive surface that has a high-resolution area...
Mark Ashdown, Peter Robinson
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
15 years 5 months ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...
EMMCVPR
2003
Springer
15 years 5 months ago
Geometric Analysis of Continuous, Planar Shapes
Abstract. We propose two differential geometric representations of planar shapes using: (i) direction functions and (ii) curvature functions, of their boundaries. Under either rep...
Anuj Srivastava, Washington Mio, Eric Klassen, Sha...
COMGEO
2004
ACM
14 years 11 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
ICCV
2007
IEEE
15 years 6 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers