Sciweavers

2950 search results - page 489 / 590
» Computing with Infinitely Many Processes
Sort
View
144
Voted
BMCBI
2004
143views more  BMCBI 2004»
15 years 2 months ago
Comparing functional annotation analyses with Catmap
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...
Thomas Breslin, Patrik Edén, Morten Krogh
BMCBI
2004
151views more  BMCBI 2004»
15 years 2 months ago
Design, implementation and evaluation of a practical pseudoknot folding algorithm based on thermodynamics
Background: The general problem of RNA secondary structure prediction under the widely used thermodynamic model is known to be NP-complete when the structures considered include a...
Jens Reeder, Robert Giegerich
SIGCSE
2002
ACM
152views Education» more  SIGCSE 2002»
15 years 1 months ago
Learning styles and performance in the introductory programming sequence
This paper reports on the implication of different preferred learning styles on students'performance in the introductory programming sequence and on work in progress on how t...
Lynda Thomas, Mark Ratcliffe, John Woodbury, Emma ...
TC
2010
15 years 19 days ago
Redundant-Digit Floating-Point Addition Scheme Based on a Stored Rounding Value
—Due to the widespread use and inherent complexity of floating-point addition, much effort has been devoted to its speedup via algorithmic and circuit techniques. We propose a ne...
Ghassem Jaberipur, Behrooz Parhami, Saeid Gorgin
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
15 years 7 days ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu