Sciweavers

315 search results - page 58 / 63
» A General Small Cancellation Theory
Sort
View
LCTRTS
2007
Springer
14 years 1 months ago
Addressing instruction fetch bottlenecks by using an instruction register file
The Instruction Register File (IRF) is an architectural extension for providing improved access to frequently occurring instructions. An optimizing compiler can exploit an IRF by ...
Stephen Roderick Hines, Gary S. Tyson, David B. Wh...
PODC
2006
ACM
14 years 1 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
SIGMETRICS
2006
ACM
114views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
On suitability of Euclidean embedding of internet hosts
In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classic...
Sanghwan Lee, Zhi-Li Zhang, Sambit Sahu, Debanjan ...
CIKM
2005
Springer
14 years 1 months ago
MailRank: using ranking for spam detection
Can we use social networks to combat spam? This paper investigates the feasibility of MailRank, a new email ranking and classification scheme exploiting the social communication ...
Paul-Alexandru Chirita, Jörg Diederich, Wolfg...