Sciweavers

1736 search results - page 127 / 348
» The rank-width of Directed Graphs
Sort
View
163
Voted
IJDSN
2008
81views more  IJDSN 2008»
15 years 5 months ago
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
This article proposes a flexible and distributed stochastic automaton-based network partitioning algorithm that is capable of finding the optimal k-way partition with respect to a...
Yan Wan, Sandip Roy, Ali Saberi, Bernard C. Lesieu...
149
Voted
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 4 months ago
Learning Networks of Stochastic Differential Equations
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...
José Bento, Morteza Ibrahimi, Andrea Montan...
JAIR
2010
99views more  JAIR 2010»
15 years 4 months ago
Developing Approaches for Solving a Telecommunications Feature Subscription Problem
Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a feature su...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...
167
Voted
MIAR
2010
IEEE
15 years 4 months ago
DTI Connectivity by Segmentation
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
Marc Niethammer, Alexis Boucharin, Christopher Zac...
197
Voted
SEMWEB
2010
Springer
15 years 4 months ago
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to repres...
Boris Motik