Sciweavers

4781 search results - page 835 / 957
» Online algorithms for network design
Sort
View
POPL
2003
ACM
16 years 1 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
CN
2002
82views more  CN 2002»
15 years 1 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
CIKM
2011
Springer
14 years 1 months ago
Building directories for social tagging systems
Today, a number of algorithms exist for constructing tag hierarchies from social tagging data. While these algorithms were designed with ontological goals in mind, we know very li...
Denis Helic, Markus Strohmaier
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
16 years 1 months ago
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
16 years 1 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes