Sciweavers

2721 search results - page 39 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
RECSYS
2009
ACM
15 years 4 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
79
Voted
IMSCCS
2006
IEEE
15 years 3 months ago
Clustering of Gene Expression Data: Performance and Similarity Analysis
Background: DNA Microarray technology is an innovative methodology in experimental molecular biology, which has produced huge amounts of valuable data in the profile of gene expre...
Longde Yin, Chun-Hsi Huang
APWEB
2005
Springer
15 years 3 months ago
An Incremental Subspace Learning Algorithm to Categorize Large Scale Text Data
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...
Jun Yan, QianSheng Cheng, Qiang Yang, Benyu Zhang
BMCBI
2008
77views more  BMCBI 2008»
14 years 9 months ago
SeqAn An efficient, generic C++ library for sequence analysis
Background: The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome [1] would not have been p...
Andreas Döring, David Weese, Tobias Rausch, K...
65
Voted
DAC
2004
ACM
15 years 10 months ago
Abstraction refinement by controllability and cooperativeness analysis
ion Refinement by Controllability and Cooperativeness Analysis Freddy Y.C. Mang and Pei-Hsin Ho Advanced Technology Group, Synopsys, Inc. {fmang, pho}@synopsys.com nt a new abstrac...
Freddy Y. C. Mang, Pei-Hsin Ho