Sciweavers

CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 11 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 11 months ago
mVideoCast: Mobile, real time ROI detection and streaming
A variety of applications are emerging to support streaming video from mobile devices. However, many tasks can benefit from streaming specific content rather than the full video f...
Scott Carter, Laurent Denoue, John Adcock
CORR
2010
Springer
110views Education» more  CORR 2010»
13 years 11 months ago
Usability Meets Instant Gratification on the Semantic Web
This paper presents a semantic wiki prototype application named SHAWN that allows structuring concepts within a wiki environment. To entice the use of Semantic Web technologies app...
David Aumueller
CORR
2010
Springer
258views Education» more  CORR 2010»
13 years 11 months ago
Single Frame Image super Resolution using Learned Directionlets
In this paper, a new directionally adaptive, learning based, single image super resolution method using multiple direction wavelet transform, called Directionlets is presented. Th...
A. P. Reji, Tessamma Thomas
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 11 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
CORR
2010
Springer
59views Education» more  CORR 2010»
13 years 11 months ago
Component Based Development
Debayan Bose
CORR
2010
Springer
95views Education» more  CORR 2010»
13 years 11 months ago
A lower bound for the tree-width of planar graphs with vital linkages
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
Isolde Adler, Philipp Klaus Krause
CORR
2010
Springer
86views Education» more  CORR 2010»
13 years 11 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 11 months ago
Discrete Partitioning and Coverage Control for Gossiping Robots
We propose distributed algorithms to automatically deploy a group of mobile robots to partition and provide coverage of a non-convex environment. To handle arbitrary nonconvex envi...
Joseph W. Durham, Ruggero Carli, Paolo Frasca, Fra...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 11 months ago
Pushing BitTorrent Locality to the Limit
Peer-to-peer (P2P) locality has recently raised a lot of interest in the community. Indeed, whereas P2P content distribution enables financial savings for the content providers, i...
Stevens Le-Blond, Arnaud Legout, Walid Dabbous