Sciweavers

899 search results - page 35 / 180
» fast 2009
Sort
View
AINA
2009
IEEE
14 years 2 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
CSE
2009
IEEE
14 years 2 months ago
Fast Fusion of Medical Images Based on Bayesian Risk Minimization and Pixon Map
Fast fusion of multiple registered out-of-focus images is of great interest in medical imaging; for example, the thoracic cavity is always too bumpy to be focused on all parts at ...
Hongbo Zhou, Qiang Cheng, Mehdi Zargham
DATE
2009
IEEE
126views Hardware» more  DATE 2009»
14 years 2 months ago
Fast and accurate protocol specific bus modeling using TLM 2.0
—The need to have Transaction Level models early in the design cycle is becoming more and more important to shorten the development times of complex Systems-on-Chip (SoC). These ...
H. W. M. van Moll, Henk Corporaal, Víctor R...
ICAS
2009
IEEE
147views Robotics» more  ICAS 2009»
14 years 2 months ago
Fast Estimation of Aggregates in Unstructured Networks
Aggregation of data values plays an important role on distributed computations, in particular over peer-to-peer and sensor networks, as it can provide a summary of some global sys...
Carlos Baquero, Paulo Sérgio Almeida, Raque...
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu