Sciweavers

1346 search results - page 64 / 270
» Algorithmic Search for Flexibility Using Resultants of Polyn...
Sort
View
GLVLSI
2009
IEEE
131views VLSI» more  GLVLSI 2009»
14 years 3 months ago
Octilinear redistributive routing in bump arrays
This paper proposes a scheme for automatic re-distribution layer (RDL) routing, which is used in chip-package connections. Traditional RDL routing designs are mostly performed man...
Renshen Wang, Chung-Kuan Cheng
ACL
2004
13 years 10 months ago
A Mention-Synchronous Coreference Resolution Algorithm Based On the Bell Tree
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
Xiaoqiang Luo, Abraham Ittycheriah, Hongyan Jing, ...
ICCAD
2002
IEEE
100views Hardware» more  ICCAD 2002»
14 years 1 months ago
Optimal buffered routing path constructions for single and multiple clock domain systems
Shrinking process geometries and the increasing use of IP components in SoC designs give rise to new problems in routing and buffer insertion. A particular concern is that cross-c...
Soha Hassoun, Charles J. Alpert, Meera Thiagarajan
GLOBECOM
2007
IEEE
14 years 3 months ago
Reduced Complexity Sphere Decoding for Square QAM via a New Lattice Representation
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
Luay Azzam, Ender Ayanoglu
ICASSP
2010
IEEE
13 years 9 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot