Sciweavers

12257 search results - page 2221 / 2452
» Analysis of Algorithms
Sort
View
152
Voted
SCIENTOMETRICS
2010
158views more  SCIENTOMETRICS 2010»
15 years 2 months ago
Rete-netzwerk-red: analyzing and visualizing scholarly networks using the Network Workbench Tool
The enormous increase in digital scholarly data and computing power combined with recent advances in text mining, linguistics, network science, and scientometrics make it possible...
Katy Börner, Weixia Huang, Micah Linnemeier, ...
138
Voted
SPIRE
2010
Springer
15 years 2 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
141
Voted
TCOM
2010
111views more  TCOM 2010»
15 years 2 months ago
Design of irregular LDPC codes with optimized performance-complexity tradeoff
—The optimal performance-complexity tradeoff for error-correcting codes at rates strictly below the Shannon limit is a central question in coding theory. This paper proposes a nu...
Benjamin Smith, Masoud Ardakani, Wei Yu, Frank R. ...
148
Voted
TCOM
2010
102views more  TCOM 2010»
15 years 2 months ago
A system performance approach to OSNR optimization in optical networks
Abstract—This paper studies a constrained optical signal-tonoise ratio (OSNR) optimization problem in optical networks from the perspective of system performance. A system optimi...
Yan Pan, Tansu Alpcan, Lacra Pavel
122
Voted
TELSYS
2010
122views more  TELSYS 2010»
15 years 2 months ago
Transmission scheduling for multi-homed transport protocols with network failure tolerance
In heterogeneous network environments, the network connections of a multi-homed device may have significant bandwidth differential. For a multihomed transmission protocol designed ...
Yuansong Qiao, Enda Fallon, John Murphy, Liam Murp...
« Prev « First page 2221 / 2452 Last » Next »