Sciweavers

674 search results - page 68 / 135
» Separating Structure from Interestingness
Sort
View
ISAAC
2001
Springer
104views Algorithms» more  ISAAC 2001»
14 years 2 months ago
Algorithms for Pattern Involvement in Permutations
We consider the problem of developing algorithms for the recognition of a fixed pattern within a permutation. These methods are based upon using a carefully chosen chain or tree ...
Michael H. Albert, Robert E. L. Aldred, Mike D. At...
SIGCOMM
1999
ACM
14 years 2 months ago
A Readable TCP in the Prolac Protocol Language
Prolac is a new statically-typed, object-oriented language for network protocol implementation. It is designed for readability, extensibility, and real-world implementation; most ...
Eddie Kohler, M. Frans Kaashoek, David R. Montgome...
IPPS
1998
IEEE
14 years 2 months ago
Using PI/OT to Support Complex Parallel I/O
This paper describes PI/OT, a template-based parallel I/O system. In PI/OT, I/O streams have annotations associated with them that are external to the source code. These annotatio...
Ian Parsons, Jonathan Schaeffer, Duane Szafron, Ro...
VL
1996
IEEE
14 years 2 months ago
Steering programs via time travel
Despite years of research into human computer interaction (HCI), the environments programmers must use for problem-solving today--with separate modes and tools for writing, compil...
John W. Atwood Jr., Margaret M. Burnett, Rebecca A...
TOOLS
1992
IEEE
14 years 2 months ago
Automating the Development of Syntax Tree Generators for an Evolving Language
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
Per Grape, Kim Walden