5100 search results - page 956 / 1020 » The Linear Complexity of a Graph |
145
click to vote
BTW
2009
Springer
15 years 11 months ago
2009
Springer
: Many model management tasks, e.g., schema matching or merging, require the manual handling of metadata. Given the diversity of metadata, its many different representations and mo...
122
click to vote
CIKM
2009
Springer
15 years 11 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
148
click to vote
CONCUR
2009
Springer
15 years 11 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...
144
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
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 ï¬...
148
click to vote
SEMWEB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Most Semantic Web applications are build on top of technology based on the Semantic Web layer cake and the W3C ontology languages RDF(S) and OWL. However RDF(S) embodies ...