Sciweavers

207 search results - page 8 / 42
» The complexity of agreement
Sort
View
ICC
2007
IEEE
121views Communications» more  ICC 2007»
15 years 3 months ago
On the Expected Complexity Analysis of a Generalized Sphere Decoding Algorithm for Underdetermined Linear Communication Systems
This paper presents an analytical approach to evaluate the expected complexity of a generalized sphere decoding (GSD) algorithm, GSDλ − , for underdetermined integer leastsquare...
Ping Wang, Tho Le-Ngoc
NOMS
2008
IEEE
15 years 4 months ago
A state-space approach to SLA based management
Large complex systems (such as Enterprise systems) are often composed of several interacting, independent components. In many such systems, although the behavior of the constituen...
Vibhore Kumar, Karsten Schwan, Subu Iyer, Yuan Che...
NAACL
2010
14 years 7 months ago
Testing a Grammar Customization System with Sahaptin
I briefly describe a system for automatically creating an implemented grammar of a natural language based on answers to a web-based questionnaire, then present a grammar of Sahapt...
Scott Drellishak
ALIFE
2008
14 years 9 months ago
Criteria for Conceptual and Operational Notions of Complexity
While complex systems have been studied now for more than two decades, there still is no agreement on what complexity actually is. This lack of a definition might be a problem when...
Dominique Chu
ASIACRYPT
2010
Springer
14 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan