Sciweavers

7978 search results - page 1549 / 1596
» Representation before computation
Sort
View
CPAIOR
2007
Springer
15 years 8 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker
107
Voted
IMA
2007
Springer
97views Cryptology» more  IMA 2007»
15 years 8 months ago
Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes
Non-linear cryptanalysis is a natural extension to Matsui’s linear cryptanalitic techniques in which linear approximations are replaced by nonlinear expressions. Non-linear appro...
Juan M. Estévez-Tapiador, John A. Clark, Ju...
IPSN
2007
Springer
15 years 8 months ago
The regiment macroprogramming system
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
Ryan Newton, Greg Morrisett, Matt Welsh
LCTRTS
2007
Springer
15 years 8 months ago
Addressing instruction fetch bottlenecks by using an instruction register file
The Instruction Register File (IRF) is an architectural extension for providing improved access to frequently occurring instructions. An optimizing compiler can exploit an IRF by ...
Stephen Roderick Hines, Gary S. Tyson, David B. Wh...
SEMWEB
2007
Springer
15 years 8 months ago
Lightweight Community-Driven Ontology Evolution
Only few well-maintained domain ontologies can be found on the Web. The likely reasons for the lack of useful domain ontologies include that (1) informal means to convey intended m...
Katharina Siorpaes
« Prev « First page 1549 / 1596 Last » Next »