Sciweavers

255 search results - page 26 / 51
» Approximate matching of secondary structures
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 8 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
FUIN
2002
107views more  FUIN 2002»
13 years 7 months ago
Towards an Ontology of Approximate Reason
Abstract. This article introduces structural aspects in an ontology of approximate reason. The basic assumption in this ontology is that approximate reason is a capability of an ag...
James F. Peters, Andrzej Skowron, Jaroslaw Stepani...
TASLP
2008
134views more  TASLP 2008»
13 years 7 months ago
Semantic Role Labeling Using a Grammar-Driven Convolution Tree Kernel
Convolution tree kernel has shown promising results in semantic role labeling (SRL). However, this kernel does not consider much linguistic knowledge in kernel design and only perf...
Min Zhang, Wanxiang Che, Guodong Zhou, AiTi Aw, Ch...
BMCBI
2005
138views more  BMCBI 2005»
13 years 7 months ago
Detailed protein sequence alignment based on Spectral Similarity Score (SSS)
Background: The chemical property and biological function of a protein is a direct consequence of its primary structure. Several algorithms have been developed which determine ali...
Kshitiz Gupta, Dina Thomas, S. V. Vidya, K. V. Ven...
DISOPT
2006
155views more  DISOPT 2006»
13 years 8 months ago
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...
Dorit S. Hochbaum, Asaf Levin