6939 search results - page 1101 / 1388 » Algorithm Engineering for Parallel Computation |
124
click to vote
CGF
1999
15 years 4 months ago
1999
We present methods for creating 3D graphical models of scenes from a limited numbers of images, i.e. one or two, in situations where no scene co-ordinate measurements are availabl...
144
click to vote
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 2 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 ...
135
click to vote
CCR
2010
15 years 1 months ago
2010
Data centers have a crucial role in current Internet architecture supporting content-centric networking. State-of-theart data centers have different architectures like fat-tree [1...
132
click to vote
DAM
2010
15 years 1 months ago
2010
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...