320 search results - page 9 / 64 » View selection using randomized search |
EC
2007
13 years 7 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
SIGMETRICS
2010
ACM
14 years 14 days ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
TIP
2008
13 years 7 months ago
2008
We consider the problem of recognizing 3-D objects from 2-D images using geometric models and assuming different viewing angles and positions. Our goal is to recognize and localize...