Sciweavers

5115 search results - page 659 / 1023
» On Randomized Lanczos Algorithms
Sort
View
VLSISP
2010
106views more  VLSISP 2010»
15 years 5 months ago
A Multi-Pronged Approach to Improving Semantic Extraction of News Video
In this paper we describe a multi-strategy approach to improving semantic extraction from news video. Experiments show the value of careful parameter tuning, exploiting multiple fe...
Alexander G. Hauptmann, Ming-yu Chen, Michael G. C...
CAIP
2009
Springer
202views Image Analysis» more  CAIP 2009»
15 years 4 months ago
Near-Regular Texture Synthesis
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...
Michal Haindl, Martin Hatka
CORR
2011
Springer
243views Education» more  CORR 2011»
15 years 1 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 1 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
200
Voted
TIT
2010
128views Education» more  TIT 2010»
15 years 1 months ago
Shannon-theoretic limits on noisy compressive sampling
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
Mehmet Akçakaya, Vahid Tarokh