Sciweavers

147 search results - page 23 / 30
» Adaptive methods for netlist partitioning
Sort
View
152
Voted
ERCIMDL
2000
Springer
147views Education» more  ERCIMDL 2000»
15 years 7 months ago
Map Segmentation by Colour Cube Genetic K-Mean Clustering
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
Vitorino Ramos, Fernando Muge
120
Voted
GRAPHICSINTERFACE
2007
15 years 5 months ago
Spectral graph-theoretic approach to 3D mesh watermarking
We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) t...
Emad E. Abdallah, A. Ben Hamza, Prabir Bhattachary...
138
Voted
NIPS
2004
15 years 5 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
153
Voted
VMV
2001
132views Visualization» more  VMV 2001»
15 years 5 months ago
Optimal Memory Constrained Isosurface Extraction
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
Dietmar Saupe, Jürgen Toelke
142
Voted
SIMPRA
2008
125views more  SIMPRA 2008»
15 years 3 months ago
Identification of Wiener models using optimal local linear models
The Wiener model is a versatile nonlinear block oriented model structure for miscellaneous applications. In this paper a method for identifying the parameters of such a model usin...
Martin Kozek, Sabina Sinanovic