478 search results - page 52 / 96 » Improving probability bounds by optimization over subsets |
ETRA
2008
ACM
13 years 9 months ago
2008
ACM
Under natural viewing conditions, human observers use shifts in gaze to allocate processing resources to subsets of the visual input. There are many computational models that try ...
PROMISE
2010
13 years 2 months ago
2010
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
—We present an alternative analysis of weighted 1 minimization for sparse signals with a nonuniform sparsity model, and extend our results to nuclear norm minimization for matric...