6251 search results - page 900 / 1251 » Randomness, Computability, and Density |
195
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Markov random fields with higher order potentials have emerged as a powerful model for several problems in computer vision. In order to facilitate their use, we propose a new rep...
192
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Seeded image segmentation is a popular type of supervised image segmentation in computer vision and image processing. Previous methods of seeded image segmentation treat the image...
237
click to vote
WEA
2010
Springer
16 years 2 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
225
click to vote
WEA
2010
Springer
16 years 2 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
190
click to vote
PDP
2009
IEEE
16 years 2 months ago
2009
IEEE
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...