Sciweavers

15485 search results - page 2621 / 3097
» Computing Optimal Subsets
Sort
View
CCS
2008
ACM
15 years 9 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
CIKM
2008
Springer
15 years 9 months ago
Real-time new event detection for video streams
Online detection of video clips that present previously unseen events in a video stream is still an open challenge to date. For this online new event detection (ONED) task, existi...
Gang Luo, Rong Yan, Philip S. Yu
NETWORKING
2010
15 years 8 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
MASCOTS
2008
15 years 8 months ago
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
Phillipa Gill, Zongpeng Li, Anirban Mahanti, Jingx...
UAI
2008
15 years 8 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
« Prev « First page 2621 / 3097 Last » Next »