Sciweavers

2629 search results - page 191 / 526
» complex 2009
Sort
View
ERCIMDL
2009
Springer
108views Education» more  ERCIMDL 2009»
15 years 10 months ago
Hoppla - Digital Preservation Support for Small Institutions
Small businesses (small office/home office, SOHO) have tremendous amounts of digital information. At the same time, they have little to no expertise on how to manage it, not to me...
Stephan Strodl, Florian Motlik, Andreas Rauber
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
15 years 10 months ago
Maximum Flow in Directed Planar Graphs with Vertex Capacities
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
Haim Kaplan, Yahav Nussbaum
ESAW
2009
Springer
15 years 10 months ago
Programming Organization-Aware Agents
Organizational notions such as roles, norms (e.g., obligations and permissions), and services are increasingly viewed as natural concepts to manage the complexity of software devel...
M. Birna van Riemsdijk, Koen V. Hindriks, Catholij...
120
Voted
ESWS
2009
Springer
15 years 10 months ago
Representing, Querying and Transforming Social Networks with RDF/SPARQL
As social networks are becoming ubiquitous on the Web, the Semantic Web goals indicate that it is critical to have a standard model allowing exchange, interoperability, transformat...
Mauro San Martín, Claudio Gutierrez
FCT
2009
Springer
15 years 10 months ago
Computing Role Assignments of Chordal Graphs
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...