Sciweavers

2542 search results - page 350 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
DSD
2006
IEEE
131views Hardware» more  DSD 2006»
14 years 2 months ago
Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip
Abstract-- Networks-on-Chip will serve as the central integration platform in future complex SoC designs, composed of a large number of heterogeneous processing resources. Most res...
Christian Neeb, Norbert Wehn
ICANN
1997
Springer
14 years 2 months ago
Topology Representing Networks for Intrinsic Dimensionality Estimation
Abstract. In this paper we compare two methods for intrinsic dimensionality (ID) estimation based on optimally topology preserving maps (OTPMs). The rst one is a direct approach, w...
Jörg Bruske, Gerald Sommer
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
14 years 5 days ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...
CODES
2009
IEEE
13 years 11 months ago
A scalable parallel H.264 decoder on the cell broadband engine architecture
The H.264 video codec provides exceptional video compression while imposing dramatic increases in computational complexity over previous standards. While exploiting parallelism in...
Michael A. Baker, Pravin Dalale, Karam S. Chatha, ...
ICASSP
2010
IEEE
13 years 10 months ago
Empirical Type-i filter design for image interpolation
Empirical filter designs generalize relationships inferred from training data to effect realistic solutions that conform well to the human visual system. Complex algorithms invol...
Karl S. Ni, Truong Q. Nguyen