Sciweavers

2354 search results - page 372 / 471
» Randomness, Stochasticity and Approximations
Sort
View
ATAL
2004
Springer
15 years 11 months ago
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...
Benoît Hudson, Tuomas Sandholm
CRYPTO
2004
Springer
118views Cryptology» more  CRYPTO 2004»
15 years 11 months ago
Short Group Signatures
ded abstract of this paper is to appear in Advances in Cryptology—CRYPTO 2004, Springer-Verlag. We construct a short group signature scheme. Signatures in our scheme are approxi...
Dan Boneh, Xavier Boyen, Hovav Shacham
ICCS
2004
Springer
15 years 11 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
PARA
2004
Springer
15 years 11 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
CSCLP
2003
Springer
15 years 11 months ago
Experimental Evaluation of Interchangeability in Soft CSPs
Abstract. In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft ...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings