Sciweavers

103 search results - page 19 / 21
» Approximating rooted Steiner networks
Sort
View
SPAA
2004
ACM
14 years 3 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
PAM
2007
Springer
14 years 4 months ago
Performance Limitations of ADSL Users: A Case Study
We report results from the analysis of a 24-hour packet trace containing TCP traffic of approximately 1300 residential ADSL clients. Some of our observations confirm earlier studi...
Matti Siekkinen, Denis Collange, Guillaume Urvoy-K...
IMC
2009
ACM
14 years 4 months ago
Geolocalization of proxied services and its application to fast-flux hidden servers
Fast-flux is a redirection technique used by cyber-criminals to hide the actual location of malicious servers. Its purpose is to evade identification and prevent or, at least de...
Claude Castelluccia, Mohamed Ali Kâafar, Per...
ESA
2006
Springer
140views Algorithms» more  ESA 2006»
14 years 2 months ago
Latency Constrained Aggregation in Sensor Networks
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
Luca Becchetti, Peter Korteweg, Alberto Marchetti-...
NN
2008
Springer
13 years 10 months ago
Multilayer in-place learning networks for modeling functional layers in the laminar cortex
Currently, there is a lack of general-purpose in-place learning networks that model feature layers in the cortex. By "general-purpose" we mean a general yet adaptive hig...
Juyang Weng, Tianyu Luwang, Hong Lu, Xiangyang Xue