Sciweavers

747 search results - page 104 / 150
» Theory and Construction of Molecular Computers
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 6 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
CCS
2005
ACM
15 years 11 months ago
PeerAccess: a logic for distributed authorization
This paper introduces the PeerAccess framework for reasoning about authorization in open distributed systems, and shows how a parameterization of the framework can be used to reas...
Marianne Winslett, Charles C. Zhang, Piero A. Bona...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
FOCS
1994
IEEE
15 years 10 months ago
The Load, Capacity and Availability of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
Moni Naor, Avishai Wool
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
16 years 6 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen