8825 search results - page 222 / 1765 » All for one or one for all |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...
97
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
: The textured images' classification assumes to consider the images in terms of area with the same texture. In uncertain environment, it could be better to take an imprecise ...
106
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
One of the most fundamental problems in large-scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely us...
103
Voted
DAM
2010
15 years 1 months ago
2010
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
DM
2010
15 years 1 months ago
2010
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...