Sciweavers

1364 search results - page 159 / 273
» Collective Optimization
Sort
View
ANOR
2011
117views more  ANOR 2011»
13 years 1 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CIDR
2011
228views Algorithms» more  CIDR 2011»
13 years 1 months ago
Crowdsourced Databases: Query Processing with People
Amazon’s Mechanical Turk (“MTurk”) service allows users to post short tasks (“HITs”) that other users can receive a small amount of money for completing. Common tasks on...
Adam Marcus 0002, Eugene Wu 0002, Samuel Madden, R...
ICDT
2011
ACM
270views Database» more  ICDT 2011»
13 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
INFOCOM
2012
IEEE
12 years 23 days ago
Estimators also need shared values to grow together
—Network management applications require large numbers of counters in order to collect traffic characteristics for each network flow. However, these counters often barely fit ...
Erez Tsidon, Iddo Hanniel, Isaac Keslassy
CVPR
2012
IEEE
12 years 23 days ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...