Sciweavers

1089 search results - page 43 / 218
» Randomness and Reducibility
Sort
View
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 3 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...
DCC
2008
IEEE
13 years 9 months ago
A Reliable Chunkless Peer-to-Peer Architecture for Multimedia Streaming
In this paper we propose a chunkless structure for multimedia distribution over peer-to-peer networks. With the proposed approach, the original multimedia packets are partitioned ...
Riccardo Bernardini, Roberto Rinaldo, Andrea Vital...
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
13 years 10 months ago
Towards Attack-Resilient Geometric Data Perturbation
Data perturbation is a popular technique for privacypreserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are no...
Keke Chen, Gordon Sun, Ling Liu
ICIP
2008
IEEE
14 years 10 months ago
Cooperative disparity and object boundary estimation
In this paper we carry out cooperatively both disparity and object boundary estimation by setting the two tasks in a unified Markovian framework. We introduce a new joint probabil...
Ramya Narasimha, Elise Arnaud, Florence Forbes, Ra...
AMAI
1999
Springer
13 years 8 months ago
Maintenance scheduling problems as benchmarks for constraint algorithms
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
Daniel Frost, Rina Dechter