Sciweavers

560 search results - page 68 / 112
» Multiplication by a Constant is Sublinear
Sort
View
135
Voted
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 10 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
113
Voted
COCOON
2007
Springer
15 years 10 months ago
Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
Chiranjeeb Buragohain, Subhash Suri, Csaba D. T&oa...
135
Voted
LATIN
2004
Springer
15 years 9 months ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse
SPAA
2010
ACM
15 years 8 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
148
Voted
ICPADS
1998
IEEE
15 years 8 months ago
A Comparison of Two Torus-Based K-Coteries
We extend a torus-based coterie structure for distributed mutual exclusion to allow k multiple entries in a critical section. In the original coterie, the system nodes are logical...
S. D. Lang, L. J. Mao