Sciweavers

253 search results - page 25 / 51
» Dynamic Trees and Dynamic Point Location
Sort
View
AMAST
2008
Springer
13 years 10 months ago
A Hybrid Approach for Safe Memory Management in C
In this paper, we present a novel approach that establishes a synergy between static and dynamic analyses for detecting memory errors in C code. We extend the standard C type syste...
Syrine Tlili, Zhenrong Yang, Hai Zhou Ling, Mourad...
COREGRID
2007
Springer
14 years 3 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
DEXA
2010
Springer
182views Database» more  DEXA 2010»
13 years 9 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
IPCV
2008
13 years 10 months ago
Weighted Embedded Zero Tree for Scalable Video Compression
Video streaming over the Internet has gained popularity during recent years mainly due to the revival of videoconferencing and videotelephony applications and the proliferation of ...
Roya Choupani, Stephan Wong, Mehmet R. Tolun
ASPDAC
2008
ACM
104views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Low power clock buffer planning methodology in F-D placement for large scale circuit design
Traditionally, clock network layout is performed after cell placement. Such methodology is facing a serious problem in nanometer IC designs where people tend to use huge clock buff...
Yanfeng Wang, Qiang Zhou, Yici Cai, Jiang Hu, Xian...