1067 search results - page 43 / 214 » Probabilistic regular graphs |
109
click to vote
NJC
2000
15 years 7 days ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
132
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
Mobile phone data provides rich dynamic information on human activities in social network analysis. In this paper, we represent data from two different modalities as a graph and f...
93
Voted
NAACL
2001
15 years 1 months ago
2001
In this paper we investigate polysemous adjectives whose meaning varies depending on the nouns they modify (e.g., fast). We acquire the meanings of these adjectives from a large c...
105
click to vote
SSPR
2004
Springer
15 years 5 months ago
2004
Springer
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
100
click to vote
RSA
2011
14 years 7 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...