Sciweavers

518 search results - page 34 / 104
» Beating a Random Assignment
Sort
View
147
Voted
DCC
2002
IEEE
16 years 2 months ago
Quantizers with Uniform Encoders and Channel Optimized Decoders
Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the Natural Binary Code and ...
Benjamin Farber, Kenneth Zeger
EUROPAR
2004
Springer
15 years 7 months ago
Visual Data Rectangular Memory
We focus on the parallel access of randomly aligned rectangular blocks of visual data. As an alternative of traditional linearly addressable memories, we suggest a memory organizat...
Georgi Kuzmanov, Georgi Gaydadjiev, Stamatis Vassi...
INFOCOM
2000
IEEE
15 years 6 months ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan
ICONIP
2007
15 years 3 months ago
Discovery of Linear Non-Gaussian Acyclic Models in the Presence of Latent Classes
Abstract. An effective way to examine causality is to conduct an experiment with random assignment. However, in many cases it is impossible or too expensive to perform controlled ...
Shohei Shimizu, Aapo Hyvärinen
BMVC
2010
15 years 15 days ago
Motion Coherent Tracking with Multi-label MRF optimization
We present a novel off-line algorithm for target segmentation and tracking in video. In our approach, video data is represented by a multi-label Markov Random Field model, and seg...
David Tsai, Matthew Flagg, James M. Rehg