Sciweavers

2713 search results - page 55 / 543
» Parameterized Tree Systems
Sort
View
ISPAN
1999
IEEE
14 years 2 months ago
Using Stochastic Intervals to Predict Application Behavior on Contended Resources
Current distributed parallel platforms can provide the resources required to execute a scientific application efficiently. However, when these platforms are shared by multiple use...
Jennifer M. Schopf, Francine Berman
MFCS
2007
Springer
14 years 4 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
SEMWEB
2009
Springer
14 years 4 months ago
TaxoMap in the OAEI 2009 Alignment Contest
Abstract. TaxoMap is an alignment tool which aims to discover rich correspondences between concepts. It performs an oriented alignment (from a source to a target ontology) and take...
Fayçal Hamdi, Brigitte Safar, Nobal B. Nira...
COMPGEOM
2004
ACM
14 years 3 months ago
Geodesic ham-sandwich cuts
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, J...
EOR
2008
136views more  EOR 2008»
13 years 10 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...