Sciweavers

Share
AAAI
2012
8 years 2 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan
AAAI
2011
8 years 11 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
CPAIOR
2011
Springer
9 years 3 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
CORR
2011
Springer
168views Education» more  CORR 2011»
9 years 6 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
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 ...
Abhimanyu Das, David Kempe
TIT
2010
171views Education» more  TIT 2010»
9 years 6 months ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin
CORR
2010
Springer
160views Education» more  CORR 2010»
9 years 8 months ago
Routing with Mutual Information Accumulation in Wireless Networks
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
Rahul Urgaonkar, Michael J. Neely
CVPR
2011
IEEE
9 years 9 months ago
Globally-Optimal Greedy Algorithms for Tracking a Variable Number of Objects
We analyze the computational problem of multi-object tracking in video sequences. We formulate the problem using a cost function that requires estimating the number of tracks, as ...
Hamed Pirsiavash, Deva Ramanan, Charless Fowlkes
SCHEDULING
2010
116views more  SCHEDULING 2010»
9 years 10 months ago
Characterizing sets of jobs that admit optimal greedy-like algorithms
The “ Priority Algorithm” is a model of computation introduced by Borodin, Nielsen and Rackoff [BNR03] which formulates a wide class of greedy algorithms. For an arbitrary se...
Periklis A. Papakonstantinou, Charles Rackoff
JCB
2000
105views more  JCB 2000»
9 years 11 months ago
A Greedy Algorithm for Aligning DNA Sequences
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
Zheng Zhang 0004, Scott Schwartz, Lukas Wagner, We...
CORR
2002
Springer
125views Education» more  CORR 2002»
9 years 11 months ago
Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP
Inthisarticle,wewillformalizethemethodofdualfittingandtheideaoffactor-revealingLP. This combination is used to design and analyze two greedy algorithms for the metric uncapacitated...
Kamal Jain, Mohammad Mahdian, Evangelos Markakis, ...
books