3946 search results - page 144 / 790 » The computational complexity of choice sets |
148
click to vote
CSFW
2005
IEEE
16 years 5 days ago
2005
IEEE
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
205
click to vote
DALT
2009
Springer
15 years 10 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
177
click to vote
DAM
2007
15 years 6 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
172
click to vote
ARC
2007
Springer
15 years 10 months ago
2007
Springer
The alignment of multiple protein (or DNA) sequences is a current problem in Bioinformatics. ClustalW is the most popular heuristic algorithm for multiple sequence alignment. Pairw...
165
click to vote
EDUTAINMENT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We have developed a learning platform to simplify and improve teaching and practice of Computer Graphics for beginners and advanced students. Our goal is to offer a set o...