1542 search results - page 202 / 309 » The metamathematics of random graphs |
110
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
155
click to vote
ERCIMDL
2010
Springer
15 years 2 months ago
2010
Springer
Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
121
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particula...
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...
105
Voted
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...