Sciweavers

2816 search results - page 215 / 564
» Submodular function minimization
Sort
View
ICALP
1998
Springer
15 years 10 months ago
Optimal Sampling Strategies in Quicksort
It is well known that the performance of quicksort can be improved by selecting the median of a sample of elements as the pivot of each partitioning stage. For large samples the pa...
Conrado Martínez, Salvador Roura
CAAN
2007
Springer
15 years 10 months ago
Preemptive Scheduling on Selfish Machines
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...
Leah Epstein, Rob van Stee
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 10 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
COCOON
2006
Springer
15 years 10 months ago
Edge Pricing of Multicommodity Networks for Selfish Users with Elastic Demands
We examine how to induce selfish heterogeneous users in a multicommodity network to reach an equilibrium that minimizes the social cost. In the absence of centralized coordination...
George Karakostas, Stavros G. Kolliopoulos
FPL
2006
Springer
99views Hardware» more  FPL 2006»
15 years 10 months ago
Reconfiguration and Fine-Grained Redundancy for Fault Tolerance in FPGAs
As manufacturing technology enters the ultra-deep submicron era, wafer yields are destined to drop due to higher occurrence of physical defects on the die. This paper proposes a y...
Nicola Campregher, Peter Y. K. Cheung, George A. C...