Sciweavers

381 search results - page 34 / 77
» On the advantage over a random assignment
Sort
View
CCS
2008
ACM
13 years 10 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 8 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner
SECON
2007
IEEE
14 years 2 months ago
OPERA: An Optimal Progressive Error Recovery Algorithm for Wireless Sensor Networks
—Wireless Sensor Networks (WSNs) require robustness against channel induced errors while retransmission based schemes prove too costly for energy constrained sensor nodes. Channe...
Saad B. Qaisar, Hayder Radha
ECCV
2008
Springer
14 years 9 months ago
Learning for Optical Flow Using Stochastic Optimization
Abstract. We present a technique for learning the parameters of a continuousstate Markov random field (MRF) model of optical flow, by minimizing the training loss for a set of grou...
Yunpeng Li, Daniel P. Huttenlocher
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...