Sciweavers

5606 search results - page 615 / 1122
» Randomization Techniques for Graphs.
Sort
View
APAL
2008
84views more  APAL 2008»
15 years 7 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret
CGF
2008
110views more  CGF 2008»
15 years 7 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
IEE
2008
108views more  IEE 2008»
15 years 7 months ago
Mining execution relations for crosscutting concerns
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
Jens Krinke
IJBIDM
2008
114views more  IJBIDM 2008»
15 years 7 months ago
Traffic mining in a road-network: How does the traffic flow?
: The flow of data coming from modern sensing devices enables the development of novel research techniques related to data management and knowledge extraction. In this work, we und...
Irene Ntoutsi, Nikos Mitsou, Gerasimos Marketos
FMSD
2007
97views more  FMSD 2007»
15 years 7 months ago
On the optimal reachability problem of weighted timed automata
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
Patricia Bouyer, Thomas Brihaye, Véronique ...