5100 search results - page 578 / 1020 » The Linear Complexity of a Graph |
197
click to vote
HIPC
2005
Springer
16 years 10 days ago
2005
Springer
We consider the problem of sensor selection so as to minimise error in estimated location of target. An algorithm based on selecting a sensor in a direction in which the error is ...
151
click to vote
ICANN
2005
Springer
16 years 10 days ago
2005
Springer
Parallel perceptrons (PPs), a novel approach to committee machine training requiring minimal communication between outputs and hidden units, allows the construction of efficient an...
154
click to vote
ICTAC
2005
Springer
16 years 9 days ago
2005
Springer
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the speci...
159
click to vote
ISSAC
2005
Springer
16 years 9 days ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
200
click to vote
WEBI
2005
Springer
16 years 8 days ago
2005
Springer
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...