Sciweavers

15 search results - page 3 / 3
» A graph-theoretic approach to webpage segmentation
Sort
View
ISBI
2011
IEEE
12 years 11 months ago
Sparse Riemannian manifold clustering for HARDI segmentation
We address the problem of segmenting high angular resolution diffusion images of the brain into cerebral regions corresponding to distinct white matter fiber bundles. We cast thi...
Hasan Ertan Çetingül, René Vida...
BMCBI
2008
103views more  BMCBI 2008»
13 years 7 months ago
The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences
Background: Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from ...
Mathieu Fourment, Mark J. Gibbs
PR
2007
189views more  PR 2007»
13 years 6 months ago
Information cut for clustering using a gradient descent approach
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...
Robert Jenssen, Deniz Erdogmus, Kenneth E. Hild II...
CVPR
2009
IEEE
15 years 2 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
KDD
2009
ACM
221views Data Mining» more  KDD 2009»
14 years 7 months ago
Migration motif: a spatial - temporal pattern mining approach for financial markets
A recent study by two prominent finance researchers, Fama and French, introduces a new framework for studying risk vs. return: the migration of stocks across size-value portfolio ...
Xiaoxi Du, Ruoming Jin, Liang Ding, Victor E. Lee,...