Sciweavers

803 search results - page 152 / 161
» Independence in Direct-Product Graphs
Sort
View
CONCUR
2009
Springer
14 years 3 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 3 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ...
Marek Lipczak, Evangelos E. Milios
FOCS
2008
IEEE
14 years 2 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
CIKM
2007
Springer
14 years 2 months ago
Ontology module extraction for ontology reuse: an ontology engineering perspective
Problems resulting from the management of shared, distributed knowledge has led to ontologies being employed as a solution, in order to effectively integrate information across a...
Paul Doran, Valentina A. M. Tamma, Luigi Iannone
GEOS
2007
Springer
14 years 2 months ago
Modeling Spatio-temporal Network Computations: A Summary of Results
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
Betsy George, Shashi Shekhar