Sciweavers

3147 search results - page 234 / 630
» Statistically Hiding Sets
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 4 days ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 9 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
ICML
2009
IEEE
15 years 6 months ago
Using fast weights to improve persistent contrastive divergence
The most commonly used learning algorithm for restricted Boltzmann machines is contrastive divergence which starts a Markov chain at a data point and runs the chain for only a few...
Tijmen Tieleman, Geoffrey E. Hinton
ICRA
2008
IEEE
229views Robotics» more  ICRA 2008»
15 years 6 months ago
Learning of moving cast shadows for dynamic environments
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
Ajay J. Joshi, Nikolaos Papanikolopoulos
ICMCS
2007
IEEE
117views Multimedia» more  ICMCS 2007»
15 years 6 months ago
Learning-Based Perceptual Image Quality Improvement for Video Conferencing
It is well known that in professional TV show filming, stage lighting has to be carefully designed in order to make the host and the scene look visually appealing. The lighting a...
Zicheng Liu, Cha Zhang, Zhengyou Zhang