13603 search results - page 340 / 2721 » On the Complexity of Computing Treelength |
184
Voted
COCO
2009
Springer
16 years 2 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
206
Voted
GLOBECOM
2008
IEEE
16 years 2 months ago
2008
IEEE
Abstract— This paper presents a low complexity iteratively detected space-time transmission architecture based on Generalized Layered Space-Time (GLST) codes and IRregular Convol...
216
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
—The realistic performance of a multi-input multi-output (MIMO) communication system depends strongly on the spatial correlation properties introduced by clustering in the propag...
212
Voted
MODELS
2007
Springer
16 years 1 months ago
2007
Springer
To promote the Model-Based software engineering development of user interfaces, this paper proposes a model driven development approach of complex user interface. The approach cap...
192
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...