Sciweavers

396 search results - page 14 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
88
Voted
ICPR
2008
IEEE
15 years 11 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»
15 years 10 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
15 years 1 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
ANOR
2005
81views more  ANOR 2005»
14 years 9 months ago
Managing Stochastic, Finite Capacity, Multi-Project Systems through the Cross-Entropy Methodology
This paper addresses the problem of loading a finite capacity, stochastic (random) and dynamic multi-project system. The system is controlled by keeping a constant number of projec...
Izack Cohen, Boaz Golany, Avraham Shtub
COCOA
2007
Springer
15 years 3 months ago
A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
The Two-Sided Crossing Minimization (TSCM) problem calls for minimizing the number of edge crossings of a bipartite graph where the two sets of vertices are drawn on two parallel l...
Lanbo Zheng, Christoph Buchheim