1469 search results - page 211 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
125
click to vote
WG
1998
Springer
15 years 7 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
182
Voted
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
—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...
163
click to vote
ICNP
2006
IEEE
15 years 9 months ago
2006
IEEE
— 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 ...
132
Voted
CP
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
166
click to vote
BIOINFORMATICS
2008
15 years 3 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...