Sciweavers

10304 search results - page 1869 / 2061
» Computer science with the sciences: an emphasis in computati...
Sort
View
ENTCS
2006
172views more  ENTCS 2006»
15 years 1 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
IJFCS
2006
130views more  IJFCS 2006»
15 years 1 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
INTEGRATION
2007
100views more  INTEGRATION 2007»
15 years 1 months ago
A fast pipelined multi-mode DES architecture operating in IP representation
The Data Encryption Standard (DES) is a cipher that is still used in a broad range of applications, from smartcards, where it is often implemented as a tamperresistant embedded co...
Sylvain Guilley, Philippe Hoogvorst, Renaud Pacale...
COMPUTER
2004
179views more  COMPUTER 2004»
15 years 1 months ago
Environmental Sensor Networks
Environmental Sensor Networks (ESNs) facilitate the study of fundamental processes and the development of hazard response systems. They have evolved from passive logging systems t...
Kirk Martinez, Jane K. Hart, Royan Ong
144
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 10 days ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
« Prev « First page 1869 / 2061 Last » Next »