Sciweavers

357 search results - page 61 / 72
» Fast Hypergraph Partition
Sort
View
GECCO
2006
Springer
142views Optimization» more  GECCO 2006»
14 years 7 days ago
Classifier prediction based on tile coding
This paper introduces XCSF extended with tile coding prediction: each classifier implements a tile coding approximator; the genetic algorithm is used to adapt both classifier cond...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...
ASPDAC
2005
ACM
120views Hardware» more  ASPDAC 2005»
13 years 10 months ago
STACCATO: disjoint support decompositions from BDDs through symbolic kernels
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
Stephen Plaza, Valeria Bertacco
GRAPHICSINTERFACE
2007
13 years 10 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...
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 10 months ago
Are approximation algorithms for consensus clustering worthwhile?
Consensus clustering has emerged as one of the principal clustering problems in the data mining community. In recent years the theoretical computer science community has generated...
Michael Bertolacci, Anthony Wirth
VMV
2001
132views Visualization» more  VMV 2001»
13 years 10 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