Sciweavers

4377 search results - page 323 / 876
» Mass problems and randomness
Sort
View
183
Voted
GLOBECOM
2009
IEEE
16 years 1 months ago
Multi-Functional Compression with Side Information
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
Soheil Feizi-Khankandi, Muriel Médard
FOCS
2008
IEEE
16 years 1 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson
PKDD
2007
Springer
120views Data Mining» more  PKDD 2007»
16 years 27 days ago
Privacy Preserving Market Basket Data Analysis
Randomized Response techniques have been empirically investigated in privacy preserving association rule mining. However, previous research on privacy preserving market basket data...
Ling Guo, Songtao Guo, Xintao Wu
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
16 years 8 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
CCGRID
2008
IEEE
16 years 1 months ago
A Stochastic Programming Approach for QoS-Aware Service Composition
—We formulate the service composition problem as a multi-objective stochastic program which simultaneously optimizes the following quality of service (QoS) parameters: workflow ...
Wolfram Wiesemann, Ronald Hochreiter, Daniel Kuhn