Sciweavers

4850 search results - page 900 / 970
» Approximate Data Structures with Applications
Sort
View
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 10 months ago
Fast Overlapping Group Lasso
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability...
Jun Liu, Jieping Ye
CSDA
2008
150views more  CSDA 2008»
14 years 10 months ago
Unimodal regression via prefix isotonic regression
This paper gives algorithms for determining real-valued univariate unimodal regressions, that is, for determining the optimal regression which is increasing and then decreasing. S...
Quentin F. Stout
ECCC
2010
95views more  ECCC 2010»
14 years 10 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
ECEASST
2006
154views more  ECEASST 2006»
14 years 10 months ago
EMF Model Refactoring based on Graph Transformation Concepts
Abstract. The Eclipse Modeling Framework (EMF) provides a modeling and code generation framework for Eclipse applications based on structured data models. Within model driven softw...
Enrico Biermann, Karsten Ehrig, Christian Köh...
IJAR
2008
67views more  IJAR 2008»
14 years 9 months ago
Implementing semantic merging operators using binary decision diagrams
There is a well-recognised need in diverse applications for reasoning with multiple, potentially inconsistent sources of information. One approach is to represent each source of i...
Nikos Gorogiannis, Anthony Hunter