Sciweavers

15073 search results - page 272 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CVPR
2008
IEEE
16 years 6 months ago
Learning class-specific affinities for image labelling
Spectral clustering and eigenvector-based methods have become increasingly popular in segmentation and recognition. Although the choice of the pairwise similarity metric (or affin...
Dhruv Batra, Rahul Sukthankar, Tsuhan Chen
AAAI
2008
15 years 6 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
MOC
2002
131views more  MOC 2002»
15 years 4 months ago
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
Douglas R. Stinson
COMPGEOM
2009
ACM
15 years 11 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...