463 search results - page 68 / 93 » A General Framework for Graph Sparsification |
144
click to vote
ISCA
2009
IEEE
15 years 10 months ago
2009
IEEE
Conventional oblivious routing algorithms are either not application-aware or assume that each flow has its own private channel to ensure deadlock avoidance. We present a framewo...
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
105
Voted
ITICSE
2009
ACM
15 years 10 months ago
2009
ACM
The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list...
114
click to vote
PADS
2006
ACM
15 years 9 months ago
2006
ACM
The development of realistic topology generators that produce faithful replicas of Internet topologies is critical for conducting realistic simulation studies of Internet protocol...
112
click to vote
CIKM
2005
Springer
15 years 9 months ago
2005
Springer
A framework for describing semantic relationships among nodes in XML documents is presented. In contrast to earlier work, the XML documents may have ID references (i.e., they corr...