Sciweavers

314 search results - page 9 / 63
» Computing all Suboptimal Alignments in Linear Space
Sort
View
PAMI
2007
176views more  PAMI 2007»
13 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
CISIS
2008
IEEE
14 years 4 months ago
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
ICPR
2000
IEEE
14 years 2 months ago
Join Tensors: On 3D-to-3D Alignment of Dynamic Sets
This paper introduces a family of ¢ ¢ tensors, referred to as “join tensors” or Jtensors for short, which perform “3D to 3D” alignment between coordinate systems of sets...
Lior Wolf, Amnon Shashua, Yonatan Wexler
JDCTA
2010
272views more  JDCTA 2010»
13 years 4 months ago
Optimal Control of Nonlinear Systems Using the Homotopy Perturbation Method: Infinite Horizon Case
This paper presents a new method for solving a class of infinite horizon nonlinear optimal control problems. In this method, first the original optimal control problem is transfor...
Amin Jajarmi, Hamidreza Ramezanpour, Arman Sargolz...
CSL
2005
Springer
14 years 3 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder