Sciweavers

646 search results - page 82 / 130
» Generalized connected domination in graphs
Sort
View
ICASSP
2011
IEEE
13 years 13 days ago
Multi-sensor estimation and detection of phase-locked sinusoids
This paper proposes a method to compute the likelihood function for the amplitudes and phase shifts of noisily observed phase-locked and amplitude-constrained sinusoids. The sinus...
Christoph Reller, Hans-Andrea Loeliger, Stefano Ma...
IJCV
2006
299views more  IJCV 2006»
13 years 8 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
GD
1998
Springer
14 years 29 days ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
BMCBI
2010
148views more  BMCBI 2010»
13 years 8 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...
SIGMETRICS
2012
ACM
253views Hardware» more  SIGMETRICS 2012»
11 years 11 months ago
Characterizing continuous time random walks on time varying graphs
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
Daniel R. Figueiredo, Philippe Nain, Bruno F. Ribe...