Sciweavers

99 search results - page 16 / 20
» Optimal Bounds on Tail Probabilities - A Simplified Approach
Sort
View
DPD
2010
153views more  DPD 2010»
13 years 4 months ago
Cardinality estimation and dynamic length adaptation for Bloom filters
Abstract Bloom filters are extensively used in distributed applications, especially in distributed databases and distributed information systems, to reduce network requirements and...
Odysseas Papapetrou, Wolf Siberski, Wolfgang Nejdl
ATAL
2009
Springer
14 years 2 months ago
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
James Pita, Manish Jain, Fernando Ordó&ntil...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
ICASSP
2009
IEEE
14 years 2 months ago
A framework for distributed multimedia stream mining systems using coalition-based foresighted strategies
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
ICDCS
2008
IEEE
14 years 1 months ago
Mobility-Assisted Spatiotemporal Detection in Wireless Sensor Networks
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...
Guoliang Xing, Jianping Wang, Ke Shen, Qingfeng Hu...