Sciweavers

630 search results - page 24 / 126
» Optimized union of non-disjoint distributed data sets
Sort
View
IEEEPACT
2008
IEEE
15 years 4 months ago
Feature selection and policy optimization for distributed instruction placement using reinforcement learning
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
Katherine E. Coons, Behnam Robatmili, Matthew E. T...
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
14 years 11 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ICML
2006
IEEE
15 years 10 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
EC
2010
176views ECommerce» more  EC 2010»
14 years 7 months ago
Learning Factorizations in Estimation of Distribution Algorithms Using Affinity Propagation
Estimation of distribution algorithms (EDAs) that use marginal product model factorizations have been widely applied to a broad range of, mainly binary, optimization problems. In ...
Roberto Santana, Pedro Larrañaga, Jos&eacut...