Sciweavers

4744 search results - page 190 / 949
» Connected Computing
Sort
View
132
Voted
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
15 years 4 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...
PAM
2005
Springer
15 years 9 months ago
On the Stationarity of TCP Bulk Data Transfers
Abstract. While the Internet offers a single best-effort service, we remark that (i) core backbones are in general over provisioned, (ii) end users have increasingly faster acces...
Guillaume Urvoy-Keller
130
Voted
WICON
2008
15 years 4 months ago
Exploiting parallel networks using dynamic channel scheduling
Many researchers have been focusing on the outcomes and consequences of the rapid increase and proliferation of mobile wireless technologies. If it is not already the case, it wil...
Lara B. Deek, Kevin C. Almeroth, Mike P. Wittie, K...
155
Voted
CGF
2005
126views more  CGF 2005»
15 years 3 months ago
FreeLence - Coding with Free Valences
We introduce FreeLence, a novel and simple single-rate compression coder for triangle manifold meshes. Our method uses free valences and exploits geometric information for connect...
Felix Kälberer, Konrad Polthier, Ulrich Reite...
WSC
2001
15 years 4 months ago
Constrained Monte Carlo and the method of control variates
A constrained Monte Carlo problem arises when one computes an expectation in the presence of a priori computable constraints on the expectations of quantities that are correlated ...
Roberto Szechtman, Peter W. Glynn