1133 search results - page 187 / 227 » Basics of Graph Cuts |
170
click to vote
FASE
2005
Springer
15 years 11 months ago
2005
Springer
This tool paper describes a modular program slicer for Java built using the Indus program analysis framework along with it’s Eclipse-based user interface called Kaveri. Indus pro...
160
click to vote
OTM
2005
Springer
15 years 11 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...
184
click to vote
VMCAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
150
click to vote
SIGADA
2004
Springer
15 years 11 months ago
2004
Springer
Refactoring is a technique for restructuring code to improve its design. A tool for automatically applying refactoring transformations to Ada 95 programs is described. The tool is...
184
click to vote
SPATIALCOGNITION
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper we apply a formal ontological framework in order to deconstruct two prominent approaches to navigation from cognitive robotics, the Spatial Semantic Hierarc...