Sciweavers

15375 search results - page 212 / 3075
» cans 2008
Sort
View
CN
1999
88views more  CN 1999»
13 years 7 months ago
Building a high-performance, programmable secure coprocessor
Secure coprocessors enable secure distributed applications by providing safe havens where an application program can Z .execute and accumulate state , free of observation and inte...
Sean W. Smith, Steve Weingart
DCG
1999
74views more  DCG 1999»
13 years 7 months ago
Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, whic...
Christos A. Athanasiadis
TIT
1998
79views more  TIT 1998»
13 years 7 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
SIGPLAN
2002
13 years 7 months ago
Trace analysis of Erlang programs
The paper reports on an experiment to provide the Erlang programming language with a tool package for convenient trace generation, collection and to support analysis of traces usi...
Thomas Arts, Lars-Åke Fredlund
SIGPLAN
2002
13 years 7 months ago
On-the-fly model checking from interval logic specifications
Future Interval Logic (FIL) and its intuitive graphical representation, Graphical Interval Logic (GIL), can be used as the formal description language of model checking tools to v...
Miguel J. Hornos, Manuel I. Capel