Sciweavers

15073 search results - page 20 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ICPR
2010
IEEE
14 years 11 months ago
Learning Probabilistic Models of Contours
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
Laure Amate, Maria João Rendas
SIGIR
2004
ACM
15 years 3 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
RSCTC
2000
Springer
126views Fuzzy Logic» more  RSCTC 2000»
15 years 1 months ago
Evolutionary Parsing for a Probabilistic Context Free Grammar
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
Lourdes Araujo
72
Voted
ICCV
2005
IEEE
15 years 3 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
JSC
2006
76views more  JSC 2006»
14 years 9 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...