Sciweavers

13214 search results - page 325 / 2643
» Pseudorandomness for network algorithms
Sort
View
NN
2010
Springer
189views Neural Networks» more  NN 2010»
15 years 1 months ago
Sparse kernel learning with LASSO and Bayesian inference algorithm
Kernelized LASSO (Least Absolute Selection and Shrinkage Operator) has been investigated in two separate recent papers (Gao et al., 2008) and (Wang et al., 2007). This paper is co...
Junbin Gao, Paul W. Kwan, Daming Shi
PERCOM
2010
ACM
15 years 1 months ago
Detecting activities from body-worn accelerometers via instance-based algorithms
The automatic and unobtrusive identification of user's activities is one of the challenging goals of context-aware computing. This paper discusses and experimentally evaluate...
Nicola Bicocchi, Marco Mamei, Franco Zambonelli
JGO
2011
165views more  JGO 2011»
14 years 9 months ago
A biased random-key genetic algorithm for routing and wavelength assignment
The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength...
Thiago F. Noronha, Mauricio G. C. Resende, Celso C...
FGCN
2008
IEEE
111views Communications» more  FGCN 2008»
16 years 1 months ago
Towards an Estimation of the Accuracy of TCP Reassembly in Network Forensics
Today, honeypot operators are strongly relying on network analysis tools to examine network traces collected in their honeynet environment. The accuracy of such analysis depends o...
Gérard Wagener, Alexandre Dulaunoy, Thomas ...
BROADNETS
2004
IEEE
15 years 10 months ago
Capacity and Delay Tradeoffs for Ad-Hoc Mobile Networks
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along mu...
Michael J. Neely, Eytan Modiano