Sciweavers

900 search results - page 139 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Aggregating preferences in multi-issue domains by using maximum likelihood estimators
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...
Lirong Xia, Vincent Conitzer, Jérôme ...
ALMOB
2006
102views more  ALMOB 2006»
13 years 8 months ago
Mining, compressing and classifying with extensible motifs
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...
Alberto Apostolico, Matteo Comin, Laxmi Parida
DM
2006
128views more  DM 2006»
13 years 8 months ago
Non-trivial t-designs without repeated blocks exist for all t
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...
Luc Teirlinck
TC
2010
13 years 3 months ago
Reconfigurable Hardware Implementations of Tweakable Enciphering Schemes
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...
Cuauhtemoc Mancillas-López, Debrup Chakrabo...
BROADNETS
2006
IEEE
14 years 2 months ago
An Energy Efficient and Accurate Slot Synchronization Scheme for Wireless Sensor Networks
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...
Lillian Dai, Prithwish Basu, Jason Redi