Sciweavers

362 search results - page 37 / 73
» Finding Motifs with Gaps
Sort
View
ECIS
2003
13 years 10 months ago
Towards an interdisciplinary theory of networks
Research problems in ICT networks often comprise coordination problems of information infrastructures and require state-of-the-art methods of coping with complex system dynamics. ...
Tim Weitzel, Oliver Wendt, Wolfgang König
ENDM
2008
93views more  ENDM 2008»
13 years 8 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
BMCBI
2011
13 years 3 months ago
Motif-guided sparse decomposition of gene expression data for regulatory module identification
Background: Genes work coordinately as gene modules or gene networks. Various computational approaches have been proposed to find gene modules based on gene expression data; for e...
Ting Gong, Jianhua Xuan, Li Chen, Rebecca B. Riggi...
ECCV
2010
Springer
14 years 3 days ago
Optimal Contour Closure by Superpixel Grouping
Abstract. Detecting contour closure, i.e., finding a cycle of disconnected contour fragments that separates an object from its background, is an important problem in perceptual gro...
APGV
2008
ACM
126views Visualization» more  APGV 2008»
13 years 10 months ago
Effect of scenario on perceptual sensitivity to errors in animation
simulations compare to similar measurements done in more abstract settings. We find that participant tolerance for certain types of errors is significantly higher in a realistic sn...
Paul S. A. Reitsma, Carol O'Sullivan