Sciweavers

157 search results - page 22 / 32
» A Universally Composable Mix-Net
Sort
View
DAGSTUHL
2008
13 years 8 months ago
Interactive Multiobjective Optimization Using a Set of Additive Value Functions
Abstract. In this chapter, we present a new interactive procedure for multiobjective optimization, which is based on the use of a set of value functions as a preference model built...
José Rui Figueira, Salvatore Greco, Vincent...
CHI
2009
ACM
14 years 8 months ago
Predicting query reformulation during web searching
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
IPPS
2005
IEEE
14 years 29 days ago
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures...
Prasanna Sugavanam, Howard Jay Siegel, Anthony A. ...

Publication
794views
15 years 3 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth