Sciweavers

544 search results - page 64 / 109
» Clustering with Instance-level Constraints
Sort
View
SGP
2004
13 years 10 months ago
Parameterization of Triangle Meshes over Quadrilateral Domains
We present a method for parameterizing irregularly triangulated input models over polyhedral domains with quadrilateral faces. A combination of center-based clustering techniques ...
Ioana M. Boier-Martin, Holly E. Rushmeier, Jingyi ...
DAGSTUHL
2007
13 years 9 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
UAI
2008
13 years 9 months ago
Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices
We introduce Clique Matrices as an alternative representation of undirected graphs, being a generalisation of the incidence matrix representation. Here we use clique matrices to d...
David Barber
GD
2008
Springer
13 years 8 months ago
Topology Preserving Constrained Graph Layout
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
Tim Dwyer, Kim Marriott, Michael Wybrow
JCP
2006
111views more  JCP 2006»
13 years 7 months ago
Mining Developing Trends of Dynamic Spatiotemporal Data Streams
This paper1 presents an efficient modeling technique for data streams in a dynamic spatiotemporal environment and its suitability for mining developing trends. The streaming data a...
Yu Meng, Margaret H. Dunham