84 search results - page 16 / 17 » Canonical structure in the universe of set theory: part one |
STOC
1997
ACM
13 years 10 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
In social media, such as blogs, since the content naturally evolves over time, it is hard or in many cases impossible to organize the content for effective navigation. Thus, one c...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
PODC
2005
ACM
13 years 11 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...