Sciweavers

2944 search results - page 180 / 589
» Improving Bound Propagation
Sort
View
INFOCOM
1993
IEEE
14 years 2 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
ALGOSENSORS
2008
Springer
14 years 12 days ago
Probabilistic Protocols for Fair Communication in Wireless Sensor Networks
In this work we present three new distributed, probabilistic data propagation protocols for Wireless Sensor Networks which aim at maximizing the network's operational life and...
Ioannis Chatzigiannakis, Lefteris M. Kirousis, Tho...
LATIN
2010
Springer
14 years 5 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin
FOCM
2011
188views more  FOCM 2011»
13 years 1 months ago
Compressive Wave Computation
This paper considers large-scale simulations of wave propagation phenomena. We argue that it is possible to accurately compute a wavefield by decomposing it onto a largely incomp...
Laurent Demanet, Gabriel Peyré
MFCS
2009
Springer
14 years 5 months ago
The Isomorphism Problem for k-Trees Is Complete for Logspace
Abstract. We show that k-tree isomorphism can be decided in logarithmic space by giving a logspace canonical labeling algorithm. This improves over the previous StUL upper bound an...
Johannes Köbler, Sebastian Kuhnert