1717 search results - page 120 / 344 » A Computable Spectral Theorem |
131
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
120
click to vote
CCA
2005
Springer
15 years 10 months ago
2005
Springer
A function f is continuous iff the pre-image f −1[V ] of any open setV is open again. Dual to this topological7 property, f is called open iff the image f [U] of any open set U ...
122
click to vote
RSFDGRC
2005
Springer
15 years 10 months ago
2005
Springer
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. Each rule is associated with three coefficients, which have been shown t...
126
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper presents a new type of scratch removal algorithm based on a causal adaptive multidimensional multitemporal prediction. The predictor use available information from the ...
117
click to vote
TIT
2008
15 years 4 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...