Sciweavers

2743 search results - page 87 / 549
» Minimization of an M-convex Function
Sort
View
CALCO
2007
Springer
138views Mathematics» more  CALCO 2007»
14 years 3 months ago
Coalgebraic Foundations of Linear Systems
Abstract. Viewing discrete-time causal linear systems as (Mealy) coalgebras, we describe their semantics, minimization and realisation as universal constructions, based on the fin...
Jan J. M. M. Rutten
JSYML
2010
62views more  JSYML 2010»
13 years 7 months ago
A monotonicity theorem for dp-minimal densely ordered groups
Dp-minimality is a common generalization of weak minimality and weak o-minimality. If T is a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal den...
John Goodrick
TIFS
2010
120views more  TIFS 2010»
13 years 4 months ago
Gibbs Construction in Steganography
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...
Tomás Filler, Jessica J. Fridrich
ICGA
2008
113views Optimization» more  ICGA 2008»
13 years 9 months ago
Move Generation with Perfect Hash Functions
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...
Trevor I. Fenner, Mark Levene
EOR
2008
93views more  EOR 2008»
13 years 9 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...