5606 search results - page 633 / 1122 » Randomization Techniques for Graphs. |
200
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
RDF Schema (RDFS) as a lightweight ontology language is gaining popularity and, consequently, tools for scalable RDFS inference and querying are needed. SPARQL has become recently ...
199
click to vote
TAMC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
146
click to vote
CIBCB
2007
IEEE
16 years 1 months ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...
170
click to vote
SMC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
223
click to vote
AGTIVE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Business process models describe workflows by a set of actions together with their ordering. When implementing business processes within a service-oriented architecture,...