Sciweavers

817 search results - page 68 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
ICISP
2010
Springer
14 years 12 days ago
Total Variation Minimization with Separable Sensing Operator
Compressed Imaging is the theory that studies the problem of image recovery from an under-determined system of linear measurements. One of the most popular methods in this field i...
Serge L. Shishkin, Hongcheng Wang, Gregory S. Hage...
NIPS
2007
13 years 10 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
PAMI
2007
202views more  PAMI 2007»
13 years 8 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ECCC
2000
140views more  ECCC 2000»
13 years 8 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
INFOCOM
2008
IEEE
14 years 3 months ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao