2746 search results - page 82 / 550 » Bisubmodular Function Minimization |
107
click to vote
CALCO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the fin...
155
click to vote
TIFS
2010
14 years 10 months ago
2010
Abstract--We make a connection between steganography design by minimizing embedding distortion and statistical physics. The unique aspect of this work and one that distinguishes it...
108
click to vote
ICGA
2008
15 years 3 months ago
2008
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
117
click to vote
ICCV
2001
IEEE
16 years 5 months ago
2001
IEEE
In this paper, we study the structure from motion problem as a constrained nonlinear least squares problem which minimizes the so called reprojection error subject to all constrai...
144
Voted
CIE
2009
Springer
15 years 10 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...