661 search results - page 118 / 133 » Local Approximation Algorithms for Scheduling Problems in Se... |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
CDC
2009
IEEE
13 years 12 months ago
2009
IEEE
— In this paper, an optimization-based adaptive Kalman filtering method is proposed. The method produces an estimate of the process noise covariance matrix Q by solving an optim...
SASO
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
QEST
2009
IEEE
14 years 3 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...