163 search results - page 28 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
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...
ACSC
2009
IEEE
14 years 3 months ago
2009
IEEE
Most text mining methods are based on representing documents using a vector space model, commonly known as a bag of word model, where each document is modeled as a linear vector r...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
APVIS
2007
13 years 10 months ago
2007
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
ICRA
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we present a probabilistic framework for the reduction in the uncertainty of a moving robot pose during exploration by using a second robot to assist. A Monte Carlo ...