Sciweavers

522 search results - page 57 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
CVPR
2009
IEEE
16 years 10 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
ICML
2004
IEEE
16 years 3 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
VLC
2002
99views more  VLC 2002»
15 years 2 months ago
Flexible Graph Layout for the Web
More powerful personal computers and higher network bandwidth has meant that graphics has become increasingly important on the web. Graph-based diagrams are one of the most import...
Trevor Hansen, Kim Marriott, Bernd Meyer, Peter J....
ACMSE
2007
ACM
15 years 7 months ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan
OA
1989
237views Algorithms» more  OA 1989»
15 years 7 months ago
Which Triangulations Approximate the Complete Graph?
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
Gautam Das, Deborah Joseph