Sciweavers

336 search results - page 60 / 68
» Approximating Transitivity in Directed Networks
Sort
View
INFOSCALE
2009
ACM
14 years 1 months ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
IWANN
1997
Springer
13 years 11 months ago
Recognition Model with Extension Fields
A recognition model which defines a measure of shape similarity on the direct output of multiscale and multiorientation Gabor filters does not manifest qualitative aspects of huma...
Peter Kalocsai
AINA
2004
IEEE
13 years 11 months ago
Authenticated Autonomous System Traceback
The design of the IP protocol makes it difficult to reliably identify the originator of an IP packet making the defense against Distributed Denial of Service attacks one of the ha...
Vamsi Paruchuri, Arjan Durresi, Rajgopal Kannan, S...
ANNPR
2008
Springer
13 years 9 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi
TON
2008
125views more  TON 2008»
13 years 7 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni