Sciweavers

1144 search results - page 29 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
102
Voted
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
15 years 6 months ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong
EMMCVPR
2011
Springer
13 years 9 months ago
Globally Optimal Image Partitioning by Multicuts
Abstract. We introduce an approach to both image labeling and unsupervised image partitioning as different instances of the multicut problem, together with an algorithm returning ...
Jörg H. Kappes, Markus Speth, Björn Andr...
78
Voted
EMNLP
2008
14 years 11 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
3DPVT
2004
IEEE
188views Visualization» more  3DPVT 2004»
15 years 1 months ago
3D Shape Registration using Regularized Medial Scaffolds
This paper proposes a novel method for global registration based on matching 3D medial structures of unorganized point clouds or triangulated meshes. Most practical known methods ...
Ming-Ching Chang, Frederic F. Leymarie, Benjamin B...
COMPGEOM
2005
ACM
14 years 11 months ago
Finding the best shortcut in a geometric network
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
Mohammad Farshi, Panos Giannopoulos, Joachim Gudmu...