Sciweavers

1388 search results - page 131 / 278
» Approximability of Robust Network Design
Sort
View
132
Voted
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 7 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
143
Voted
WCNC
2010
IEEE
15 years 7 months ago
META: A Mobility Model of MEtropolitan TAxis Extracted from GPS Traces
In this paper, we present our study of extracting a mobility model for vehicular ad hoc networks (VANETs) from a large amount of real taxi GPS trace data. In order to capture char...
Hongyu Huang, Yanmin Zhu, Xu Li, Minglu Li, Min-Yo...
COMPUTING
2010
15 years 28 days ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
149
Voted
CCR
2005
131views more  CCR 2005»
15 years 3 months ago
A clean slate 4D approach to network control and management
Today's data networks are surprisingly fragile and difficult to manage. We argue that the root of these problems lies in the complexity of the control and management planes--...
Albert G. Greenberg, Gísli Hjálmt&ya...
129
Voted
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
15 years 5 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...