Sciweavers

15073 search results - page 84 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 8 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
CONCURRENCY
2010
112views more  CONCURRENCY 2010»
15 years 3 months ago
Performance results of running parallel applications on the InteGrade
The InteGrade project is an on-going project with the participation of several research groups in Brazil. It is an opportunistic grid middleware that intends to exploit the idle t...
E. N. Cáceres, Henrique Mongelli, L. Lourei...
SAC
2006
ACM
15 years 9 months ago
Facial emotion recognition by adaptive processing of tree structures
We present an emotion recognition system based on a probabilistic approach to adaptive processing of Facial Emotion Tree Structures (FETS). FETS are made up of localized Gabor fea...
Jia-Jun Wong, Siu-Yeung Cho
ICPR
2008
IEEE
15 years 9 months ago
A probabilistic model for classifying segmented images
In this work we introduce a probabilistic model for classifying segmented images. The proposed classifier is very general and it can deal both with images that were segmented wit...
Liang Wu, Predrag Neskovic, Leon N. Cooper
FCT
2009
Springer
15 years 9 months ago
Independence Results for n-Ary Recursion Theorems
The n-ary first and second recursion theorems formalize two distinct, yet similar, notions of self-reference. Roughly, the n-ary first recursion theorem says that, for any n algo...
John Case, Samuel E. Moelius