Sciweavers

16430 search results - page 793 / 3286
» On Computable Tree Functions
Sort
View
CPM
2004
Springer
109views Combinatorics» more  CPM 2004»
16 years 28 days ago
Approximate Labelled Subtree Homeomorphism
Given two undirected trees T and P, the Subtree Homeomorphism Problem is to find whether T has a subtree t that can be transformed into P by removing entire subtrees, as well as ...
Ron Y. Pinter, Oleg Rokhlenko, Dekel Tsur, Michal ...
IWPC
2003
IEEE
16 years 24 days ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...
INFOCOM
2000
IEEE
15 years 12 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
IUI
2000
ACM
15 years 12 months ago
NaturalJava: a natural language interface for programming in Java
NaturalJava is a prototype for an intelligent natural-languagebased user interface for creating, modifying, and examining Java programs. The interface exploits three subsystems. T...
David Price, Ellen Riloff, Joseph L. Zachary, Bran...
POPL
1993
ACM
15 years 11 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach