5100 search results - page 386 / 1020 » The Linear Complexity of a Graph |
202
Voted
CORR
2011
Springer
15 years 2 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
228
click to vote
AGTIVE
2007
Springer
16 years 1 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
173
click to vote
KI
2007
Springer
16 years 1 months ago
2007
Springer
Information visualisation benefits from the Semantic Web: multimodal mobile interfaces to the Semantic Web offer access to complex knowledge and information structures. Natural l...
167
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases...
179
click to vote
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
Fundamental to any graph cut segmentation methods is the assignment of edge weights. The existing solutions typically use gaussian, exponential or rectangular cost functions with ...