Sciweavers

12863 search results - page 2288 / 2573
» Dynamic Data Mining
Sort
View
PLDI
2006
ACM
15 years 10 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
SIGCOMM
2006
ACM
15 years 10 months ago
A measurement study on the impact of routing events on end-to-end internet path performance
Extensive measurement studies have shown that end-to-end Internet path performance degradation is correlated with routing dynamics. However, the root cause of the correlation betw...
Feng Wang, Zhuoqing Morley Mao, Jia Wang, Lixin Ga...
DASFAA
2005
IEEE
256views Database» more  DASFAA 2005»
15 years 10 months ago
CoCache: Query Processing Based on Collaborative Caching in P2P Systems
Peer-to-peer (P2P) computing is gaining more and more significance due to its widespread use currently and potential deployments in future applications. In this paper, we propose ...
Weining Qian, Linhao Xu, Shuigeng Zhou, Aoying Zho...
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 10 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
INFOCOM
2005
IEEE
15 years 10 months ago
Optimal ISP subscription for Internet multihoming: algorithm design and implication analysis
— Multihoming is a popular method used by large enterprises and stub ISPs to connect to the Internet to reduce cost and improve performance. Recently researchers have studied the...
Hao Wang, Haiyong Xie 0002, Lili Qiu, Abraham Silb...
« Prev « First page 2288 / 2573 Last » Next »