5100 search results - page 255 / 1020 » The Linear Complexity of a Graph |
125
click to vote
NETWORKS
2010
15 years 2 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
144
click to vote
GLOBECOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
146
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
117
click to vote
BPM
2010
Springer
15 years 5 months ago
2010
Springer
We propose a new semantics for the inclusive converging gateway (also known as Or-join). The new semantics coincides with the intuitive, widely agreed semantics for Or-joins on sou...
132
click to vote
ASAP
2007
IEEE
15 years 10 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...