1369 search results - page 185 / 274 » Lattice computations for random numbers |
CVPR
2010
IEEE
14 years 5 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...
WEA
2010
Springer
14 years 4 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...
WEA
2010
Springer
14 years 4 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 ...
PDP
2009
IEEE
14 years 4 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...
APSCC
2007
IEEE
14 years 3 months ago
2007
IEEE
A suitable assignment of agents to handle the workload at a call center is not easy to fulfill because it requires a combinatorial optimization with large solution space and the n...