Sciweavers

551 search results - page 55 / 111
» Natural proofs
Sort
View
ICML
2009
IEEE
14 years 9 months ago
Online dictionary learning for sparse coding
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...
COMSWARE
2006
IEEE
14 years 2 months ago
FACTS - A rule-based middleware architecture for wireless sensor networks
ing a middleware abstraction layer into wireless sensor networks is a widely accepted solution to facilitate application programming and allow network organization. In this paper,...
Kirsten Terfloth, Georg Wittenburg, Jochen H. Schi...
TCC
2010
Springer
170views Cryptology» more  TCC 2010»
14 years 5 months ago
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
JDA
2011
104views more  JDA 2011»
13 years 3 months ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
CSFW
1997
IEEE
14 years 28 days ago
Eliminating Covert Flows with Minimum Typings
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
Dennis M. Volpano, Geoffrey Smith