Sciweavers

886 search results - page 104 / 178
» On the Autoreducibility of Random Sequences
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
CVPR
2009
IEEE
1081views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Learning Real-Time MRF Inference for Image Denoising
Many computer vision problems can be formulated in a Bayesian framework with Markov Random Field (MRF) or Conditional Random Field (CRF) priors. Usually, the model assumes that ...
Adrian Barbu (Florida State University)
FOCS
1998
IEEE
14 years 2 days ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
AIA
2007
13 years 9 months ago
Classification of biomedical high-resolution micro-CT images for direct volume rendering
This paper introduces a machine learning approach into the process of direct volume rendering of biomedical highresolution 3D images. More concretely, it proposes a learning pipel...
Maite López-Sánchez, Jesús Ce...
JUCS
2006
114views more  JUCS 2006»
13 years 7 months ago
Pseudorandom Number Generation: Impossibility and Compromise
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, ...