Sciweavers

468 search results - page 31 / 94
» Symmetric majority rules
Sort
View
EUROCRYPT
1999
Springer
15 years 2 months ago
An Analysis of Exponentiation Based on Formal Languages
A recoding rule for exponentiation is a method for reducing the cost of the exponentiation ae by reducing the number of required multiplications. If w(e) is the (hamming) weight of...
Luke O'Connor
WETICE
1999
IEEE
15 years 2 months ago
Collective Choice in Virtual Teams
Virtual organisations within and across enterprise structures are becoming mature as a potentially effective means for goal oriented business teamwork. Among the plentyful of supp...
Alois Ferscha, Christoph Scheiner
ATVA
2006
Springer
206views Hardware» more  ATVA 2006»
15 years 1 months ago
Compositional Reasoning for Hardware/Software Co-verification
In this paper, we present and illustrate an approach to compositional reasoning for hardware/software co-verification of embedded systems. The major challenges in compositional rea...
Fei Xie, Guowu Yang, Xiaoyu Song
LREC
2010
123views Education» more  LREC 2010»
14 years 11 months ago
Developing Morphological Analysers for South Asian Languages: Experimenting with the Hindi and Gujarati Languages
A considerable amount of work has been put into development of stemmers and morphological analysers. The majority of these approaches use hand-crafted suffix-replacement rules but...
Niraj Aswani, Robert J. Gaizauskas
SIGGRAPH
2010
ACM
15 years 2 months ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel