4913 search results - page 819 / 983 » Results and Perspectives of the G |
189
click to vote
COLOGNETWENTE
2010
15 years 3 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
177
click to vote
DAGM
2010
Springer
15 years 3 months ago
2010
Springer
We present a model-driven approach to the segmentation of nasal cavity and paranasal sinus boundaries. Based on computed tomography data of a patients head, our approach aims to ex...
176
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
— It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linear...
174
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
175
click to vote
CMIG
2010
15 years 1 months ago
2010
This paper presents a novel method for unsupervised DNA microarray gridding based on Support Vector Machines (SVMs). Each spot is a small region on the microarray surface where cha...