Sciweavers

1653 search results - page 290 / 331
» Directed tree-width examples
Sort
View
ICPPW
2002
IEEE
15 years 6 months ago
A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks
In this paper, we use the tensor product notation as the framework of a programming methodology for designing block recursive algorithms on various computer networks. In our previ...
Min-Hsuan Fan, Chua-Huang Huang, Yeh-Ching Chung
STOC
2010
ACM
261views Algorithms» more  STOC 2010»
15 years 6 months ago
An Improved LP-based Approximation for Steiner Tree
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss...
MFCS
2009
Springer
15 years 6 months ago
Time-Bounded Kolmogorov Complexity and Solovay Functions
Abstract. A Solovay function is a computable upper bound g for prefixfree Kolmogorov complexity K that is nontrivial in the sense that g agrees with K, up to some additive constan...
Rupert Hölzl, Thorsten Kräling, Wolfgang...
UIC
2009
Springer
15 years 6 months ago
MeshVision: An Adaptive Wireless Mesh Network Video Surveillance System
The major surveillance camera manufacturers have begun incorporating wireless networking functionality into their products to enable wireless access. However, the video feeds from ...
Peizhao Hu, Ryan Wishart, Jimmy Ti, Marius Portman...
120
Voted
MICCAI
2001
Springer
15 years 6 months ago
Segmentation of Dynamic N-D Data Sets via Graph Cuts Using Markov Models
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
Yuri Boykov, Vivian S. Lee, Henry Rusinek, Ravi Ba...