Sciweavers

373 search results - page 32 / 75
» Identifying graphs from noisy and incomplete data
Sort
View
ICCV
1999
IEEE
14 years 9 months ago
Fast Approximate Energy Minimization via Graph Cuts
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
Yuri Boykov, Olga Veksler, Ramin Zabih
AVI
2006
13 years 9 months ago
Preserving the mental map in interactive graph interfaces
Graphs provide good representations for many domains. Interactive graph-based interfaces are desireable to browse and edit data for these domains. However, as graphs increase in s...
Manuel Freire, Pilar Rodríguez
SDM
2008
SIAM
120views Data Mining» more  SDM 2008»
13 years 9 months ago
Spatial Scan Statistics for Graph Clustering
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
Bei Wang, Jeff M. Phillips, Robert Schreiber, Denn...
BIBE
2007
IEEE
129views Bioinformatics» more  BIBE 2007»
13 years 11 months ago
Statistial Analysis of nucleosome occupancy and histone modification data
Abstract-- In eukaryotic cells, genomic DNAs wrap around beadlike molecules, called nucleosomes, so as to pack more compactly in the nucleus of the cell. The nucleosome is made up ...
Guo-Cheng Yuan, Jun S. Liu
ICDAR
2005
IEEE
14 years 1 months ago
A Novel Approach to Recover Writing Order From Single Stroke Offline Handwritten Images
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
Yu Qiao, Makoto Yasuhara