843 search results - page 60 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
161
click to vote
AI
2011
Springer
14 years 5 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
143
click to vote
JGTOOLS
2006
15 years 1 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
121
click to vote
INFOCOM
2010
IEEE
14 years 12 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
128
click to vote
IM
2007
15 years 2 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...
108
click to vote
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...