Sciweavers

285 search results - page 54 / 57
» New Ways to Construct Binary Search Trees
Sort
View
CGO
2011
IEEE
14 years 3 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...
KDD
2005
ACM
194views Data Mining» more  KDD 2005»
16 years 1 days ago
Web object indexing using domain knowledge
Web object is defined to represent any meaningful object embedded in web pages (e.g. images, music) or pointed to by hyperlinks (e.g. downloadable files). Users usually search for...
Muyuan Wang, Zhiwei Li, Lie Lu, Wei-Ying Ma, Naiya...
BMCBI
2010
96views more  BMCBI 2010»
14 years 11 months ago
Incorporating gene co-expression network in identification of cancer prognosis markers
Background: Extensive biomedical studies have shown that clinical and environmental risk factors may not have sufficient predictive power for cancer prognosis. The development of ...
Shuangge Ma, Mingyu Shi, Yang Li, Danhui Yi, Ben-C...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 3 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
BMCBI
2007
186views more  BMCBI 2007»
14 years 11 months ago
Modeling human cancer-related regulatory modules by GA-RNN hybrid algorithms
Background: Modeling cancer-related regulatory modules from gene expression profiling of cancer tissues is expected to contribute to our understanding of cancer biology as well as...
Jung-Hsien Chiang, Shih-Yi Chao