843 search results - page 63 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
118
click to vote
TON
2010
14 years 12 months ago
2010
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
125
click to vote
DATESO
2007
15 years 2 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
106
click to vote
FUIN
2006
15 years 1 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
110
click to vote
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
105
click to vote
IPMU
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...