Sciweavers

661 search results - page 76 / 133
» Levels of a scale-free tree
Sort
View
ISCAS
2008
IEEE
191views Hardware» more  ISCAS 2008»
14 years 3 months ago
A novel approach for K-best MIMO detection and its VLSI implementation
— Since the complexity of MIMO detection algorithms is exponential, the K–best algorithm is often chosen for efficient VLSI implementation. This detection problem is often view...
Sudip Mondal, Khaled N. Salama, Wersame H. Ali
IV
2008
IEEE
119views Visualization» more  IV 2008»
14 years 3 months ago
CAT: A Hierarchical Image Browser Using a Rectangle Packing Technique
The recent revolution of digital camera technology has resulted in much larger collections of images. Image browsing techniques thus become increasingly important for overview and...
Ai Gomi, Reiko Miyazaki, Takayuki Itoh, Jia Li
ICRA
2007
IEEE
126views Robotics» more  ICRA 2007»
14 years 3 months ago
Flying Fast and Low Among Obstacles
— Safe autonomous flight is essential for widespread acceptance of aircraft that must fly close to the ground. We have developed a method of collision avoidance that can be use...
Sebastian Scherer, Sanjiv Singh, Lyle Chamberlain,...
PARELEC
2002
IEEE
14 years 1 months ago
Dynamic Process Partitioning and Migration for Irregular Applications
Many practical applications generate irregular, nonbalanced divide-and-conquer trees which have different depths, possibly also different numbers of successors at different levels...
Pawel Czarnul
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
14 years 1 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
Cheng-Kok Koh, Patrick H. Madden