Sciweavers

2826 search results - page 439 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
BMCBI
2008
114views more  BMCBI 2008»
15 years 6 months ago
Testing the Coulomb/Accessible Surface Area solvent model for protein stability, ligand binding, and protein design
Background: Protein structure prediction and computational protein design require efficient yet sufficiently accurate descriptions of aqueous solvent. We continue to evaluate the ...
Marcel Schmidt am Busch, Anne Lopes, Najette Amara...
FOCS
2009
IEEE
16 years 1 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
BMCBI
2008
172views more  BMCBI 2008»
15 years 6 months ago
Compo: composite motif discovery using discrete models
Background: Computational discovery of motifs in biomolecular sequences is an established field, with applications both in the discovery of functional sites in proteins and regula...
Geir Kjetil Sandve, Osman Abul, Finn Drablø...
DCOSS
2009
Springer
16 years 1 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye