112 search results - page 14 / 23 » Developers ask reachability questions |
COMBINATORICS
2007
13 years 7 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
MMS
2008
13 years 7 months ago
2008
While many multimedia systems allow the association of semantic annotations with media assets, there is no agreedupon way of sharing these among systems. As an initial step within...
JIIS
2007
13 years 7 months ago
2007
The Internet has instigated a critical need for automated tools that facilitate integrating countless databases. Since non-technical end users are often the ultimate repositories ...
TSD
2010
Springer
13 years 5 months ago
2010
Springer
This paper is focused on the evaluation of listening test that was realized with a view to objectively annotate expressive speech recordings and further develop a limited domain ex...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...