Sciweavers

4377 search results - page 194 / 876
» Mass problems and randomness
Sort
View
EUROCRYPT
2010
Springer
15 years 10 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
ECCV
2010
Springer
15 years 8 months ago
Image Segmentation with Topic Random Field
Abstract. Recently, there has been increasing interests in applying aspect models (e.g., PLSA and LDA) in image segmentation. However, these models ignore spatial relationships amo...
VMV
2008
107views Visualization» more  VMV 2008»
15 years 8 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
FOCM
2008
156views more  FOCM 2008»
15 years 6 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
JAIR
2006
121views more  JAIR 2006»
15 years 6 months ago
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
Matthew J. Streeter, Stephen F. Smith