Sciweavers

736 search results - page 14 / 148
» Approximating the Number of Network Motifs
Sort
View
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 1 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
INFOCOM
2009
IEEE
14 years 2 months ago
Hardness and Approximation of the Survivable Multi-Level Fat Tree Problem
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
Hung Q. Ngo, Thanh-Nhan Nguyen, Dahai Xu
NIPS
2008
13 years 8 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
TSMC
1998
135views more  TSMC 1998»
13 years 7 months ago
Universal stabilization using control Lyapunov functions, adaptive derivative feedback, and neural network approximators
— In this paper, the problem of stabilization of unknown nonlinear dynamical systems is considered. An adaptive feedback law is constructed that is based on the switching adaptiv...
Elias B. Kosmatopoulos
ALGOSENSORS
2009
Springer
14 years 2 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
Zeev Nutov, Michael Segal