Sciweavers

449 search results - page 17 / 90
» Degenerate crossing numbers
Sort
View
CAGD
2008
143views more  CAGD 2008»
13 years 7 months ago
A genus oblivious approach to cross parameterization
In this paper we present a robust approach to construct a map between two triangulated meshes, M and M' of arbitrary and possibly unequal genus. We introduce a novel initial ...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy
GLVLSI
2005
IEEE
110views VLSI» more  GLVLSI 2005»
14 years 1 months ago
QCA channel routing with wire crossing minimization
Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of electron charge configuration in chemica...
Brian Stephen Smith, Sung Kyu Lim
ICPR
2008
IEEE
14 years 8 months ago
Bilateral symmetry of object silhouettes under perspective projection
Symmetry is an important property of objects and is exhibited in different forms e.g., bilateral, rotational, etc. This paper presents an algorithm for computing the bilateral sym...
Cornelia Fermüller, Hyoungjune Yi, Konstantin...
KDD
2007
ACM
142views Data Mining» more  KDD 2007»
14 years 7 months ago
Towards Privacy-Preserving Model Selection
Abstract. Model selection is an important problem in statistics, machine learning, and data mining. In this paper, we investigate the problem of enabling multiple parties to perfor...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
GD
2006
Springer
13 years 11 months ago
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz