3353 search results - page 574 / 671 » Laver and set theory |
WWW
2007
ACM
15 years 10 months ago
2007
ACM
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
MOBIHOC
2009
ACM
15 years 10 months ago
2009
ACM
Providing differentiated Quality of Service (QoS) over unreliable wireless channels is an important challenge for supporting several future applications. We analyze a model that h...
108
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
PODS
2006
ACM
15 years 10 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...