Sciweavers

6562 search results - page 152 / 1313
» Noetherianity and Combination Problems
Sort
View
JMLR
2010
109views more  JMLR 2010»
15 years 28 days ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
211
Voted
ICDAR
2011
IEEE
14 years 5 months ago
Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation
—Handwritten text line segmentation on real-world data presents significant challenges that cannot be overcome by any single technique. Given the diversity of approaches and the...
Vasant Manohar, Shiv Naga Prasad Vitaladevuni, Hua...
ICASSP
2011
IEEE
14 years 10 months ago
Periodic CRB for non-Bayesian parameter estimation
In many practical parameter estimation problems, the appropriate criterion is periodic in the parameter space. This paper considers the mean square periodic error (MSPE) criterion...
Tirza Routtenberg, Joseph Tabrikian
184
Voted
CADE
2012
Springer
13 years 8 months ago
Taming Past LTL and Flat Counter Systems
Abstract. Reachability and LTL model-checking problems for flat counter systems are known to be decidable but whereas the reachability problem can be shown in NP, the best known c...
Stéphane Demri, Amit Kumar Dhar, Arnaud San...
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
15 years 7 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...