Sciweavers

1806 search results - page 94 / 362
» Randomness and halting probabilities
Sort
View
3DOR
2008
13 years 11 months ago
Markov Random Fields for Improving 3D Mesh Analysis and Segmentation
Mesh analysis and clustering have became important issues in order to improve the efficiency of common processing operations like compression, watermarking or simplification. In t...
Guillaume Lavoué, Christian Wolf
ICPR
2010
IEEE
13 years 11 months ago
Compressing Sparse Feature Vectors Using Random Ortho-Projections
In this paper we investigate the usage of random ortho-projections in the compression of sparse feature vectors. The study is carried out by evaluating the compressed features in ...
Esa Rahtu, Mikko Salo, Janne Heikkilä
NIPS
2007
13 years 10 months ago
A Randomized Algorithm for Large Scale Support Vector Learning
This paper investigates the application of randomized algorithms for large scale SVM learning. The key contribution of the paper is to show that, by using ideas random projections...
Krishnan Kumar, Chiru Bhattacharyya, Ramesh Hariha...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
13 years 10 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 9 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...