Sciweavers

1282 search results - page 68 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
INFOCOM
2008
IEEE
14 years 3 months ago
On Survivable Access Network Design: Complexity and Algorithms
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
Dahai Xu, Elliot Anshelevich, Mung Chiang
WSC
2004
13 years 10 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
14 years 9 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
WOWMOM
2005
ACM
195views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible withi...
Mirco Musolesi, Stephen Hailes, Cecilia Mascolo