1830 search results - page 253 / 366 » Workshop on Graph Computation Models |
160
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
145
click to vote
JMLR
2010
14 years 12 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
181
Voted
MM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
145
Voted
TIP
2008
15 years 5 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
140
click to vote
MIDDLEWARE
2004
Springer
15 years 10 months ago
2004
Springer
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...