Sciweavers

292 search results - page 31 / 59
» Scaling properties of the Internet graph
Sort
View
WISE
2002
Springer
14 years 14 days ago
Cluster-Based Delta Compression of a Collection of Files
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
Zan Ouyang, Nasir D. Memon, Torsten Suel, Dimitre ...
ICCS
2009
Springer
14 years 2 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
IM
2008
13 years 7 months ago
Finding Strongly Knit Clusters in Social Networks
Social networks are ubiquitous. The discovery of close-knit clusters in these networks is of fundamental and practical interest. Existing clustering criteria are limited in that c...
Nina Mishra, Robert Schreiber, Isabelle Stanton, R...
TCAD
2008
195views more  TCAD 2008»
13 years 7 months ago
Multilayer Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
Chung-Wei Lin, Shih-Lun Huang, Kai-Chi Hsu, Meng-X...
WWW
2004
ACM
14 years 8 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo