Sciweavers

948 search results - page 37 / 190
» What can we achieve by arbitrary announcements
Sort
View
ICC
2007
IEEE
14 years 1 months ago
Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
Tao Cui, Tracey Ho, Chintha Tellambura
ACMDIS
2000
ACM
13 years 12 months ago
The Building Blocks of Experience: An Early Framework for Interaction Designers
Design activity has recently attempted to embrace “designing the user experience.” Designers need to demystify how we design for user experience and how the products we design...
Jodi Forlizzi, Shannon Ford
CCCG
2006
13 years 9 months ago
On the Maximum Span of Fixed-Angle Chains
Soss proved that it is NP-hard to find the maximum flat span of a fixed-angle polygonal chain: the largest distance achievable between the endpoints in a planar embedding. These f...
Nadia Benbernou, Joseph O'Rourke
APAL
2007
111views more  APAL 2007»
13 years 7 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons
DAGSTUHL
2007
13 years 9 months ago
Choosing Your Beliefs
Abstract This paper presents and discusses a novel approach to indeterministic belief revision. An indeterministic belief revision operator assumes that, when an agent is confronte...
Guido Boella, Célia da Costa Pereira, Gabri...