Sciweavers

7133 search results - page 203 / 1427
» Communication algorithms with advice
Sort
View
INFOCOM
2000
IEEE
15 years 9 months ago
An Empirical Evaluation of Client-Side Server Selection Algorithms
—Efficient server selection algorithms reduce retrieval time for objects replicated on different servers and are an important component of Internet cache architectures. This pap...
Sandra G. Dykes, Kay A. Robbins, Clinton L. Jeffer...
168
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
Sparse recovery with graph constraints: Fundamental limits and measurement construction
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang
TOG
2012
267views Communications» more  TOG 2012»
13 years 7 months ago
Global parametrization by incremental flattening
Global parametrization of surfaces requires singularities (cones) to keep distortion minimal. We describe a method for finding cone locations and angles and an algorithm for glob...
Ashish Myles, Denis Zorin
ICC
2007
IEEE
142views Communications» more  ICC 2007»
15 years 11 months ago
Simulative Analysis of a Multi-Cell Admission Control Algorithm in WCDMA Networks
— It has for long been recognized that in multi-cell wide-band code division multiple access (WCDMA) networks the admission of a new session into the system can have undesirable ...
Gábor Fodor, Gustavo Azzolin
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
15 years 10 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes