Sciweavers

1477 search results - page 278 / 296
» Complexity of (iterated) dominance
Sort
View
ICFP
2008
ACM
14 years 8 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
ECCV
2008
Springer
14 years 7 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
DATE
2009
IEEE
242views Hardware» more  DATE 2009»
14 years 3 months ago
A high performance reconfigurable Motion Estimation hardware architecture
Motion Estimation (ME) is the most computationally intensive part of video compression and video enhancement systems. For the recently available high definition frame sizes and hi...
Ozgur Tasdizen, Halil Kukner, Abdulkadir Akin, Ilk...
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
14 years 3 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ICC
2008
IEEE
136views Communications» more  ICC 2008»
14 years 3 months ago
New Beamforming Schemes with Optimum Receive Combining for Multiuser MIMO systems
— In this paper, we present a new beamforming scheme for a downlink of multiuser multiple-input multipleoutput (MIMO) communication systems. Recently, a blockdiagonalization (BD)...
Sang-Rim Lee, Seokhwan Park, Sung Hyun Moon, Inkyu...