4526 search results - page 522 / 906 » Algorithmic problems related to the Internet |
223
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
203
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
170
Voted
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
186
Voted
AAAI
2010
15 years 8 months ago
2010
Lifting can greatly reduce the cost of inference on firstorder probabilistic graphical models, but constructing the lifted network can itself be quite costly. In online applicatio...
206
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...