Sciweavers

10608 search results - page 104 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
TCOM
2008
151views more  TCOM 2008»
13 years 10 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
SAC
2008
ACM
13 years 9 months ago
Computational methods for complex stochastic systems: a review of some alternatives to MCMC
We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
Paul Fearnhead
IV
2005
IEEE
99views Visualization» more  IV 2005»
14 years 3 months ago
Heterogeneous Objects Modelling and Rendering Using Implicit Complexes
This paper describes a technology for modelling and rendering heterogeneous objects containing entities of various dimensionalities within a cellular-functional framework based on...
Elena Kartasheva, Valery Adzhiev, Peter Comninos, ...
IEEEICCI
2002
IEEE
14 years 3 months ago
Software Agents: Quality, Complexity and Uncertainty Issues
In software engineering community there is an increasing effort of design and development of multiagent systems (MAS). Among several issues emerging from this initiative, complexi...
Behrouz Homayoun Far
COCO
2000
Springer
161views Algorithms» more  COCO 2000»
14 years 2 months ago
Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
Ronald de Wolf