Sciweavers

6506 search results - page 1269 / 1302
» Algorithmic models for sensor networks
Sort
View
PR
2008
123views more  PR 2008»
14 years 9 months ago
Extensions of vector quantization for incremental clustering
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
Edwin Lughofer
TCBB
2008
103views more  TCBB 2008»
14 years 9 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
95
Voted
TCS
2008
14 years 9 months ago
Optimizing deletion cost for secure multicast key management
Multicast and broadcast are efficient ways to deliver messages to a group of recipients in a network. Due to the growing security concerns in various applications, messages are oft...
Zhi-Zhong Chen, Ze Feng, Minming Li, F. Frances Ya...
67
Voted
JUCS
2007
133views more  JUCS 2007»
14 years 9 months ago
Building Immersive Conversation Environment Using Locomotive Interactive Character
: Generating composite human motion such as locomotion and gestures is important for interactive applications, such as interactive storytelling and computer games. In interactive s...
Rai Chan, Junichi Hoshino
106
Voted
COMCOM
2002
86views more  COMCOM 2002»
14 years 9 months ago
The potential costs and benefits of long-term prefetching for content distribution
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In traditional short-term prefetching, caches use recent access history to ...
Arun Venkataramani, Praveen Yalagandula, Ravi Kokk...
« Prev « First page 1269 / 1302 Last » Next »