750 search results - page 98 / 150 » Reconstruction for Models on Random Graphs |
SENSYS
2003
ACM
15 years 5 months ago
2003
ACM
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
100
click to vote
FUIN
2008
14 years 12 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
111
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
126
click to vote
ACST
2006
15 years 1 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
P2P
2009
IEEE
15 years 6 months ago
2009
IEEE
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...