Sciweavers

8695 search results - page 366 / 1739
» Making the Complex Simple
Sort
View
COCOON
2009
Springer
16 years 1 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
ISCC
2008
IEEE
130views Communications» more  ISCC 2008»
16 years 1 months ago
A graph theory based scheduling algorithm For MIMO-CDMA systems using zero forcing beamforming
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...
Elmahdi Driouch, Wessam Ajib
APCSAC
2007
IEEE
16 years 1 months ago
A Power-Aware Alternative for the Perceptron Branch Predictor
Abstract. The perceptron predictor is a highly accurate branch predictor. Unfortunately this high accuracy comes with high complexity. The high complexity is the result of the larg...
Kaveh Aasaraai, Amirali Baniasadi
144
Voted
IROS
2006
IEEE
120views Robotics» more  IROS 2006»
16 years 26 days ago
3D Pose Visual Servoing Relieves Parallel Robot Control from Joint Sensing
— In this paper, we show that visual feedback reduces the complexity of parallel robot Cartesian control. Namely, 3D pose visual servoing, where the end-effector pose is indirect...
Tej Dallej, Nicolas Andreff, Youcef Mezouar, Phili...
ASAP
2005
IEEE
118views Hardware» more  ASAP 2005»
16 years 14 days ago
Real-time H/W Implementation of the Approximate Discrete Radon Transform
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real-time impl...
Michael T. Frederick, Nathan A. VanderHorn, Arun K...