Sciweavers

2128 search results - page 66 / 426
» A general characterization of indulgence
Sort
View
108
Voted
IGPL
2011
14 years 7 months ago
Existentially equivalent cyclic ultrametric spaces and cyclically valued groups
The notions of ultrametric distances and cyclic valuations appear when the set of values of the distance map is a cyclically ordered set. These structures can be described as subsp...
Gérard Leloup
117
Voted
SIAMJO
2010
125views more  SIAMJO 2010»
14 years 7 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
89
Voted
JMLR
2010
84views more  JMLR 2010»
14 years 7 months ago
Learning Exponential Families in High-Dimensions: Strong Convexity and Sparsity
The versatility of exponential families, along with their attendant convexity properties, make them a popular and effective statistical model. A central issue is learning these mo...
Sham Kakade, Ohad Shamir, Karthik Sindharan, Ambuj...
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 10 months ago
Matching Dependencies with Arbitrary Attribute Values: Semantics, Query Answering and Integrity Constraints
Matching dependencies (MDs) are used to declaratively specify the identification (or matching) of certain attribute values in pairs of database tuples when some similarity conditi...
Jaffer Gardezi, Leopoldo E. Bertossi, Iluju Kiring...
103
Voted
MICS
2010
124views more  MICS 2010»
14 years 7 months ago
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
George B. Mertzios, Walter Unger