248 search results - page 38 / 50 » A Simple Optimal Randomized Algorithm for Sorting on the PDM |
IACR
2011
12 years 7 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
ICIP
1995
IEEE
14 years 9 months ago
1995
IEEE
Recently a class of multiscale stochastic models has been introducedin which Gaussian random processes are described by scale-recursive dynamics that are indexed by the nodes of a...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...