865 search results - page 116 / 173 » Random graph models for the web graph |
144
Voted
TSP
2008
15 years 3 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
133
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
116
click to vote
ACSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
102
Voted
TSP
2008
15 years 3 months ago
2008
Abstract--We present a versatile framework for tractable computation of approximate variances in large-scale Gaussian Markov random field estimation problems. In addition to its ef...
143
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
The collective contributions of billions of users across the globe each day result in an ever-changing web. In verticals like news and real-time search, recency is an obvious sign...