Sciweavers

12194 search results - page 70 / 2439
» cans 2010
Sort
View
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 6 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
ENTCS
2010
88views more  ENTCS 2010»
13 years 6 months ago
Range and Set Abstraction using SAT
d Set Abstraction using SAT Edd Barrett Andy King School of Computing, University of Kent, CT2 7NF, UK Symbolic decision trees are not the only way to correlate the relationship b...
Edd Barrett, Andy King
INFORMATICALT
2010
102views more  INFORMATICALT 2010»
13 years 6 months ago
An Computation-Efficient Generalized Group-Oriented Cryptosystem
A Group-Oriented Cryptosystem (GOC) allows a sender to encrypt a message sent to a group of users so only the specified sets of users in that group can cooperatively decrypt the me...
Ting-Yi Chang
CAP
2010
13 years 3 months ago
Polynomial homotopies on multicore workstations
Homotopy continuation methods to solve polynomial systems scale very well on parallel machines. In this paper we examine its parallel implementation on multiprocessor multicore wo...
Jan Verschelde, Genady Yoffe
ECCC
2010
147views more  ECCC 2010»
13 years 3 months ago
A Note on Amplifying the Error-Tolerance of Locally Decodable Codes
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma