Sciweavers

16218 search results - page 3060 / 3244
» Standards
Sort
View
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 6 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
AML
2007
68views more  AML 2007»
15 years 6 months ago
A note on weak dividing
We study the notion of weak dividing introduced by S. Shelah. In particular we prove that T is stable iff weak dividing is symmetric. In order to study simple theories Shelah orig...
Byunghan Kim, Niandong Shi
APAL
2007
111views more  APAL 2007»
15 years 6 months ago
A coverage construction of the reals and the irrationals
I modify the standard coverage construction of the reals to obtain the irrationals. However, this causes a jump in ordinal complexity from ω + 1 to Ω. The coverage technique ha...
Harold Simmons
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
15 years 6 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
BMCBI
2010
132views more  BMCBI 2010»
15 years 6 months ago
Protein docking by Rotation-Based Uniform Sampling (RotBUS) with fast computing of intermolecular contact distance and residue d
Background: Protein-protein interactions are fundamental for the majority of cellular processes and their study is of enormous biotechnological and therapeutic interest. In recent...
Albert Solernou, Juan Fernández-Recio
« Prev « First page 3060 / 3244 Last » Next »