Sciweavers

6142 search results - page 476 / 1229
» The Complexity of Partition Functions
Sort
View
VTC
2006
IEEE
114views Communications» more  VTC 2006»
16 years 26 days ago
Block-LDPC Codes vs Duo-Binary Turbo-Codes for European Next Generation Wireless Systems
Abstract—In this paper, we investigate the performancecomplexity trade-off for two leading-edge channel coding techniques, namely Duo-Binary Turbo-Codes (DBTC) and Block LDPC Cod...
Thierry Lestable, Ernesto Zimmerman, Marie-H&eacut...
PCI
2005
Springer
16 years 11 days ago
Middleware for Building Ubiquitous Computing Applications Using Distributed Objects
Ubiquitous systems are characterized by multi-fold complexity, stemming mainly from the vast number of possible interactions between many heterogeneous objects and services. Device...
Nicolas Drossos, Eleni Christopoulou, Achilles Kam...
SG
2010
Springer
15 years 12 months ago
Articulate: A Semi-automated Model for Translating Natural Language Queries into Meaningful Visualizations
While many visualization tools exist that offer sophisticated functions for charting complex data, they still expect users to possess a high degree of expertise in wielding the to...
Yiwen Sun, Jason Leigh, Andrew E. Johnson, Sangyoo...
VISUALIZATION
1998
IEEE
15 years 11 months ago
Progressive tetrahedralizations
This paper describes some fundamental issues for robust implementations of progressively refined tetrahedralizations generated through sequences of edge collapses. We address the ...
Oliver G. Staadt, Markus H. Gross
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 11 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara