Sciweavers

944 search results - page 67 / 189
» A Survey on Counting Networks
Sort
View
FMCAD
2007
Springer
15 years 6 months ago
Fast Minimum-Register Retiming via Binary Maximum-Flow
We present a formulation of retiming to minimize the number of registers in a design by iterating a maximum network flow problem. The retiming returned will be the optimum one whi...
Aaron P. Hurst, Alan Mishchenko, Robert K. Brayton
INFOCOM
2008
IEEE
15 years 6 months ago
Minerva: Learning to Infer Network Path Properties
—Knowledge of the network path properties such as latency, hop count, loss and bandwidth is key to the performance of overlay networks, grids and p2p applications. Network operat...
Rita H. Wouhaybi, Puneet Sharma, Sujata Banerjee, ...
IMA
2009
Springer
132views Cryptology» more  IMA 2009»
15 years 6 months ago
Subspace Codes
Abstract. This paper is a survey of bounds and constructions for subspace codes designed for the injection metric, a distance measure that arises in the context of correcting adver...
Azadeh Khaleghi, Danilo Silva, Frank R. Kschischan...
CORR
2006
Springer
103views Education» more  CORR 2006»
14 years 12 months ago
AS Relationships: Inference and Validation
Research on performance, robustness, and evolution of the global Internet is fundamentally handicapped without accurate and thorough knowledge of the nature and structure of the c...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, M...
ICDM
2007
IEEE
103views Data Mining» more  ICDM 2007»
15 years 6 months ago
An Examination of Experimental Methodology for Classifiers of Relational Data
Experimental methodology for evaluating classification algorithms in relational (i.e., networked) data is complicated by dependencies between related data instances. We survey the...
Brian Gallagher, Tina Eliassi-Rad