Sciweavers

7228 search results - page 606 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
COMPGEOM
2006
ACM
16 years 1 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
MM
2006
ACM
130views Multimedia» more  MM 2006»
16 years 1 months ago
An unsupervised method for clustering images based on their salient regions of interest
We have developed a biologically-motivated, unsupervised way of grouping together images whose salient regions of interest (ROIs) are perceptually similar regardless of the visual...
Gustavo B. Borba, Humberto R. Gamba, Oge Marques, ...
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
16 years 21 days ago
Search-based improvement of subsystem decompositions
The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
COMPGEOM
2003
ACM
16 years 13 days ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
DOCENG
2003
ACM
16 years 13 days ago
Handling syntactic constraints in a DTD-compliant XML editor
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...
Y. S. Kuo, Jaspher Wang, N. C. Shih