5316 search results - page 144 / 1064 » Which Search Problems Are Random |
132
Voted
P2P
2005
IEEE
15 years 9 months ago
2005
IEEE
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
133
Voted
AINA
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
145
Voted
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
113
Voted
WWW
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we propose to model the blended search problem by assuming conditional dependencies among queries, VSEs and search results. The probability distributions of this mo...
129
click to vote
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...