Sciweavers

93 search results - page 15 / 19
» The complexity of the weight problem for permutation and mat...
Sort
View
BMCBI
2005
94views more  BMCBI 2005»
13 years 7 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel
COCOON
2010
Springer
14 years 8 days ago
Tracking a Generator by Persistence
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 8 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...
CIKM
2009
Springer
14 years 2 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
NIPS
1993
13 years 8 months ago
Analyzing Cross-Connected Networks
The non-linear complexities of neural networks make network solutions difficult to understand. Sanger's contribution analysis is here extended to the analysis of networks aut...
Thomas R. Shultz, Jeffrey L. Elman