Sciweavers

4488 search results - page 288 / 898
» Properties of NP-Complete Sets
Sort
View
ICPR
2006
IEEE
16 years 8 months ago
Multi-Subset Selection for Keyword Extraction and Other Prototype Search Tasks Using Feature Selection Algorithms
We present a framework that enables the use of traditional feature selection algorithms in a new context - for building a set of subsets of specified properties. During the course...
Pavel Pudil, Petr Somol
ICML
2009
IEEE
16 years 7 months ago
Group lasso with overlap and graph lasso
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
Laurent Jacob, Guillaume Obozinski, Jean-Philippe ...
CHI
2002
ACM
16 years 7 months ago
Tangible programming elements for young children
Tangible programming elements offer the dynamic and programmable properties of a computer without the complexity introduced by the keyboard, mouse and screen. This paper explores ...
Peta Wyeth, Helen C. Purchase
CADE
2006
Springer
16 years 7 months ago
Automating Proofs in Category Theory
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
Dexter Kozen, Christoph Kreitz, Eva Richter
ESORICS
2002
Springer
16 years 6 months ago
Confidentiality-Preserving Refinement is Compositional - Sometimes
Confidentiality-preserving refinement describes a relation between a specification and an implementation that ensures that all confidentiality properties required in the specificat...
Thomas Santen, Maritta Heisel, Andreas Pfitzmann