900 search results - page 139 / 180 » On Polynomial Time Computation over Unordered Structures |
114
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a maximum likelihood estimation (MLE) approach to preference aggregation and voting when the set of alternatives has a multi-issue structure, and the voter...
137
click to vote
ALMOB
2006
15 years 3 months ago
2006
Background: Motif patterns of maximal saturation emerged originally in contexts of pattern discovery in biomolecular sequences and have recently proven a valuable notion also in t...
156
click to vote
DM
2006
15 years 3 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
177
click to vote
TC
2010
14 years 10 months ago
2010
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...
132
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
2006
IEEE
Existing slotted channel access schemes in wireless networks assume that slot boundaries at all nodes are synchronized. In practice, relative clock drifts among nodes cause slot mi...