Sciweavers

866 search results - page 73 / 174
» On Dynamic Shortest Paths Problems
Sort
View
IDMS
2000
Springer
128views Multimedia» more  IDMS 2000»
13 years 11 months ago
Fast and Optimal Multicast-Server Selection Based on Receivers' Preference
Abstract. In this paper, we propose static and dynamic server selection techniques for multicast receivers who receive multiple streams from replicated servers. In the proposed sta...
Akihito Hiromori, Hirozumi Yamaguchi, Keiichi Yasu...
ICDCSW
2002
IEEE
14 years 20 days ago
Reducing the Cost of the Critical Path in Secure Multicast for Dynamic Groups
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
Sandeep S. Kulkarni, Bezawada Bruhadeshwar
INFOCOM
2003
IEEE
14 years 1 months ago
Detecting Network Intrusions via Sampling: A Game Theoretic Approach
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
Murali S. Kodialam, T. V. Lakshman
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
14 years 9 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
TCBB
2008
113views more  TCBB 2008»
13 years 7 months ago
Efficient Algorithms for the Computational Design of Optimal Tiling Arrays
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
Alexander Schliep, Roland Krause