8125 search results - page 1413 / 1625 » Parallelism and evolutionary algorithms |
131
click to vote
COMPUTING
1999
15 years 4 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
113
click to vote
TELSYS
2002
15 years 4 months ago
2002
Abstract. In this paper, we present a receiver-oriented, request/response protocol for the Web that is compatible with the dynamics of TCP's congestion control algorithm. The ...
146
Voted
DGCI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
141
click to vote
JSC
2010
15 years 3 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
145
click to vote
FOIKS
2010
Springer
15 years 2 months ago
2010
Springer
This paper holds on the application of two classification methods based on formal concept analysis (FCA) to interval data. The first method uses a similarity between objects while ...