Sciweavers

2018 search results - page 139 / 404
» Code Normal Forms
Sort
View
RTAS
2003
IEEE
15 years 7 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee
141
Voted
ICA
2010
Springer
15 years 3 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
TIT
2008
83views more  TIT 2008»
15 years 2 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
KBSE
2007
IEEE
15 years 8 months ago
Parseweb: a programmer assistant for reusing open source code on the web
Programmers commonly reuse existing frameworks or libraries to reduce software development efforts. One common problem in reusing the existing frameworks or libraries is that the...
Suresh Thummalapenta, Tao Xie
155
Voted
CRYPTO
2005
Springer
171views Cryptology» more  CRYPTO 2005»
15 years 8 months ago
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge ...