Sciweavers

6610 search results - page 856 / 1322
» Community Structures of Networks
Sort
View
AINA
2009
IEEE
15 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
AINA
2007
IEEE
15 years 11 months ago
Un-biasing the Link Farm Effect in PageRank Computation
Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The o...
Arnon Rungsawang, Komthorn Puntumapon, Bundit Mana...
ICNP
2006
IEEE
15 years 11 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
INFOCOM
2005
IEEE
15 years 10 months ago
Fast replication in content distribution overlays
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar...
136
Voted
IMC
2005
ACM
15 years 10 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang