Results 1  10
of
4,113
Enumerating minimal subset feedback vertex sets.
 In Proceedings of WADS 2011, LNCS 6844:399–410,
, 2011
"... Abstract The Subset Feedback Vertex Set problem takes as input a pair (G, S), where G = (V, E) is a graph with weights on its vertices, and S ⊆ V . The task is to find a set of vertices of total minimum weight to be removed from G, such that in the remaining graph no cycle contains a vertex of S. W ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. We show that this problem can be solved in time O(1.8638 n ), where n = V . This is a consequence of the main result of this paper, namely that all minimal subset feedback vertex sets of a graph can be enumerated in time O(1.8638 n ).
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ¹ minimization
 PROC. NATL ACAD. SCI. USA 100 2197–202
, 2002
"... Given a ‘dictionary’ D = {dk} of vectors dk, we seek to represent a signal S as a linear combination S = ∑ k γ(k)dk, with scalar coefficients γ(k). In particular, we aim for the sparsest representation possible. In general, this requires a combinatorial optimization process. Previous work considered ..."
Abstract

Cited by 633 (38 self)
 Add to MetaCart
optimization problem: specifically, minimizing the ℓ¹ norm of the coefficients γ. In this paper, we obtain parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems. We introduce the Spark, ameasure of linear dependence
Markov Logic Networks
 MACHINE LEARNING
, 2006
"... We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract

Cited by 816 (39 self)
 Add to MetaCart
in the domain, it specifies a ground Markov network containing one feature for each possible grounding of a firstorder formula in the KB, with the corresponding weight. Inference in MLNs is performed by MCMC over the minimal subset of the ground network required for answering the query. Weights are efficiently
Minimal Subset Evaluation: Rapid Warmup for Simulated Hardware State
 In Proceedings of the 2001 International Conference on Computer Design
, 2001
"... This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is commonly used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch pred ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is commonly used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch
Minimal Subset Evaluation: Rapid Warmup for Simulated Hardware State
"... This paper introduces minimal subset evaluation (MSE) as a way IO reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is common1.y used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch pr ..."
Abstract
 Add to MetaCart
This paper introduces minimal subset evaluation (MSE) as a way IO reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is common1.y used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch
Minimal Subset Evaluation: Rapid Warmup for Simulated Hardware State
"... This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is commonly used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch pred ..."
Abstract
 Add to MetaCart
This paper introduces minimal subset evaluation (MSE) as a way to reduce time spent on largestructure warmup during the fastforwarding portion of processor simulations. Warm up is commonly used prior to fulldetail simulation to avoid coldstart bias in large structures like caches and branch
Regression Shrinkage and Selection Via the Lasso
 JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B
, 1994
"... We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactl ..."
Abstract

Cited by 4212 (49 self)
 Add to MetaCart
We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients
A Singular Value Thresholding Algorithm for Matrix Completion
, 2008
"... This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task of reco ..."
Abstract

Cited by 555 (22 self)
 Add to MetaCart
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood as the convex relaxation of a rank minimization problem, and arises in many important applications as in the task
Relations between the statistics of natural images and the response properties of cortical cells
 J. Opt. Soc. Am. A
, 1987
"... The relative efficiency of any particular imagecoding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images f ..."
Abstract

Cited by 831 (18 self)
 Add to MetaCart
relatively high signaltonoise ratio and permits information to be transmitted with only a subset of the total number of cells. These results support Barlow's theory that the goal of natural vision is to represent the information in the natural environment with minimal redundancy.
Results 1  10
of
4,113