Results 1  10
of
71
Oblivious Assignment with m Slots
"... Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues to be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m slo ..."
Abstract
 Add to MetaCart
Preserving anonymity and privacy of customer actions within a complex software system, such as a cloud computing system, is one of the main issues to be solved in order to boost private computation outsourcing. In this paper, we propose a coordination paradigm, namely oblivious assignment with m
Towards practical oblivious ram
 In NDSS
, 2012
"... We take an important step forward in making Oblivious RAM (ORAM) practical. We propose an ORAM construction achieving an amortized overhead of 20 ∼ 35X (for an ORAM roughly 1 terabyte in size), about 63 times faster than the best existing scheme. On the theoretic front, we propose a fundamentall ..."
Abstract

Cited by 56 (13 self)
 Add to MetaCart
fundamentally novel technique for constructing Oblivious RAMs: specifically, we partition a bigger ORAM into smaller ORAMs, and employ a background eviction technique to obliviously evict blocks from the clientside cache into a randomly assigned serverside partition. This novel technique is the key
Oblivious interference scheduling
 IN PROCEEDINGS OF THE 28THANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC
, 2009
"... In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wireless network. In the directed version of the problem, each pair of points consists of a dedicated sending and a dedicated ..."
Abstract

Cited by 43 (12 self)
 Add to MetaCart
” and is the established way of modelling interference in the engineering community. The objective is to minimize the number of colors as this corresponds to the time needed to schedule all requests. We study oblivious power assignments in which the power value of a pair only depends on the distance between the points
Wireless Capacity with Oblivious Power in General Metrics
"... The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a senderreceiver pair located in a metric space, and an assignment of power to the senders. We s ..."
Abstract

Cited by 25 (8 self)
 Add to MetaCart
metric. We use this to give essentially tight characterizations of capacity maximization under power control using oblivious power assignments. Specifically, we show that the mean
Oblivious bounds on the probability of Boolean functions
 ACM Trans. Database Syst. (TODS
"... This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. w ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i
Oblivious Bounds on the Probability of Boolean Functions
, 2013
"... This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i.e. wh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an exact characterization of optimal oblivious bounds, i
Optimal and Heuristic ApplicationAware Oblivious Routing
"... Abstract—Conventional oblivious routing algorithms do not take into account resource requirements (e.g., bandwidth, latency) of various flows in a given application. As they are not aware of flow demands that are specific to the application, network resources can be poorly utilized and cause serious ..."
Abstract
 Add to MetaCart
than traditional deterministic and oblivious routing schemes on popular synthetic benchmarks using our bandwidthsensitive approach. We also show that, when oblivious routing is used and there are more flows than virtual channels per link, the static assignment of virtual channels to flows can help
3 Basic routing theory I – Oblivious routing
"... Now that we had a look at how well certain families of networks can perform routing, we want to concentrate on the problem of how to find good paths in networks. One way would be to simply calculate the best collection of paths for a given routing problem and then to use it to send the messages. Thi ..."
Abstract
 Add to MetaCart
destination pair (and maybe a random choice to select one of the options). Formally, this can be expressed as follows: Definition 3.1 An oblivious routing strategy is specified by a path system P and a function w assigning a weight to every path in P. w has the property that for every sourcedestination pair (s, t
Pruning irrelevant features from oblivious decision trees
 In Proceedings of the AAAI Fall Symposium on Relevance, 145148
, 1994
"... Abstract In this paper, we examine an approach to feature selection designed to handle domains that involve both irrelevant and interacting features. We review the reasons this situation poses challenges to both nearest neighbor and decisiontree methods, then describe a new algorithm OBLIVION th ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
that carries out greedy pruning of oblivious decision trees. We summarize the results of experiments with artificial domains, which show that OBLIVION'S sample complexity grows slowly with the number of irrelevant features, and with natural domains, which suggest that few existing data sets
Deterministic identity testing for sum of readonce oblivious arithmetic branching programs
 In 30th Conference on Computational Complexity, CCC 2015
"... A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding bl ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
A readonce oblivious arithmetic branching program (ROABP) is an arithmetic branching program (ABP) where each variable occurs in at most one layer. We give the first polynomial time whitebox identity test for a polynomial computed by a sum of constantly many ROABPs. We also give a corresponding
Results 1  10
of
71