Sciweavers

2186 search results - page 238 / 438
» Considering an Organization's Memory
Sort
View
ICC
2007
IEEE
16 years 28 days ago
Computing Maximum-Likelihood Bounds for Reed-Solomon Codes over Partial Response Channels
Abstract—Computing maximum-likelihood bounds on the performance of systems involving partial response (PR) channels, with or without an error correcting code present, is rather c...
Richard M. Todd, J. R. Cruz
INFOCOM
2007
IEEE
16 years 27 days ago
Scalability of Routing Tables in Wireless Networks
— Consider a large wireless ad hoc network that facilitates communication between random pairs of network nodes. The paper investigates the size of routing tables as the number o...
Petar Momcilovic
ISMVL
2007
IEEE
92views Hardware» more  ISMVL 2007»
16 years 26 days ago
Experimental Studies on SAT-Based ATPG for Gate Delay Faults
The clock rate of modern chips is still increasing and at the same time the gate size decreases. As a result, already slight variations during the production process may cause a f...
Stephan Eggersglüß, Daniel Tille, G&oum...
ISQED
2007
IEEE
107views Hardware» more  ISQED 2007»
16 years 26 days ago
Recursive Function Smoothing of Half-Perimeter Wirelength for Analytical Placement
Inspired by recent success of analytical placers that use a logarithmsum-exponential (LSE) to smooth half-perimeter wirelength (HPWL), we consider in this paper two alternative sm...
Chen Li 0004, Cheng-Kok Koh
IV
2007
IEEE
111views Visualization» more  IV 2007»
16 years 26 days ago
Geographic Routing on Improved Coordinates
We consider routing methods for networks when geographic positions of nodes are available. Instead of using the original geographic coordinates, however, we precompute virtual coo...
Ulrik Brandes, Daniel Fleischer