Sciweavers

849 search results - page 125 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
DCC
2006
IEEE
14 years 8 months ago
Optimal Index Assignment for Multiple Description Lattice Vector Quantization
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
Xiang Huang, Xiaolin Wu
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
14 years 6 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
ICCD
2004
IEEE
98views Hardware» more  ICCD 2004»
14 years 6 months ago
Thermal-Aware IP Virtualization and Placement for Networks-on-Chip Architecture
Networks-on-Chip (NoC), a new SoC paradigm, has been proposed as a solution to mitigate complex on-chip interconnect problems. NoC architecture consists of a collection of IP core...
Wei-Lun Hung, Charles Addo-Quaye, Theo Theocharide...
ICCAD
2001
IEEE
111views Hardware» more  ICCAD 2001»
14 years 6 months ago
Congestion Aware Layout Driven Logic Synthesis
In this paper, we present novel algorithms that effectively combine physical layout and early logic synthesis to improve overall design quality. In addition, we employ partitionin...
Thomas Kutzschebauch, Leon Stok
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 4 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak