Sciweavers

1133 search results - page 189 / 227
» Basics of Graph Cuts
Sort
View
FSTTCS
1998
Springer
14 years 1 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
TAPSOFT
1997
Springer
14 years 1 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
AGTIVE
2007
Springer
14 years 28 days ago
Generating Domain-Specific Model Editors with Complex Editing Commands
Abstract. Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of d...
Gabriele Taentzer, André Crema, René...
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 24 days ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
ERSHOV
2006
Springer
14 years 18 days ago
A Versioning and Evolution Framework for RDF Knowledge Bases
We present an approach to support the evolution of online, distributed, reusable, and extendable ontologies based on the RDF data model. The approach works on the basis of atomic c...
Sören Auer, Heinrich Herre