Sciweavers

162 search results - page 31 / 33
» Mining for the most certain predictions from dyadic data
Sort
View
CIKM
1997
Springer
13 years 11 months ago
Analysis and Design of Server Informative WWW-Sites
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...
JIB
2007
172views more  JIB 2007»
13 years 7 months ago
The ABC (Analysing Biomolecular Contacts)-database
As protein-protein interactions are one of the basic mechanisms in most cellular processes, it is desirable to understand the molecular details of protein-protein contacts and ult...
Peter Walter, Sam Ansari, Volkhard Helms
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 1 days ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
BMCBI
2010
117views more  BMCBI 2010»
13 years 7 months ago
Identification of NAD interacting residues in proteins
Background: Small molecular cofactors or ligands play a crucial role in the proper functioning of cells. Accurate annotation of their target proteins and binding sites is required...
Hifzur Rahman Ansari, Gajendra P. S. Raghava
SADM
2010
196views more  SADM 2010»
13 years 2 months ago
Bayesian adaptive nearest neighbor
: The k nearest neighbor classification (k-NN) is a very simple and popular method for classification. However, it suffers from a major drawback, it assumes constant local class po...
Ruixin Guo, Sounak Chakraborty