Sciweavers

1688 search results - page 203 / 338
» The Complexity of Rationalizing Matchings
Sort
View
VTC
2006
IEEE
15 years 5 months ago
Group-Based Linear Parallel Interference Cancellation for DS-CDMA Systems
— The increase in the demand for voice and data wireless services creates a need for a more efficient use of the available bandwidth. Current and future generations cellular sys...
Benoit Pelletier, Benoît Champagne
DATE
2005
IEEE
165views Hardware» more  DATE 2005»
15 years 5 months ago
Flexible Hardware/Software Support for Message Passing on a Distributed Shared Memory Architecture
With the advent of multi-processor systems on a chip, the interest for message passing libraries has revived. Message passing helps in mastering the design complexity of parallel ...
Francesco Poletti, Antonio Poggiali, Paul Marchal
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
15 years 5 months ago
Energy- and Performance-Driven NoC Communication Architecture Synthesis Using a Decomposition Approach
In this paper, we present a methodology for customized communication architecture synthesis that matches the communication requirements of the target application. This is an impor...
Ümit Y. Ogras, Radu Marculescu
ICAC
2005
IEEE
15 years 5 months ago
The Case for Automated Planning in Autonomic Computing
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizin...
Biplav Srivastava, Subbarao Kambhampati
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
15 years 5 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram