Sciweavers

17688 search results - page 7 / 3538
» Data Set Balancing
Sort
View
QUESTA
2006
100views more  QUESTA 2006»
14 years 11 months ago
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
Thomas Bonald, Laurent Massoulié, Alexandre...
93
Voted
ICNP
1997
IEEE
15 years 3 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
91
Voted
IACR
2011
110views more  IACR 2011»
13 years 11 months ago
On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme
With the gaining popularity of remote storage (e.g. in the Cloud), we consider the setting where a small, protected local machine wishes to access data on a large, untrusted remot...
Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky
87
Voted
EOR
2006
129views more  EOR 2006»
14 years 11 months ago
Balancing assembly lines with tabu search
Balancing assembly lines is a crucial task for manufacturing companies in order to improve productivity and minimize production costs. Despite some progress in exact methods to so...
Sophie D. Lapierre, Angel B. Ruiz, Patrick Soriano
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 11 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount