Sciweavers

230 search results - page 32 / 46
» The Inclusion Problem for Regular Expressions
Sort
View
ICFP
2007
ACM
14 years 7 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
BMCBI
2010
157views more  BMCBI 2010»
13 years 7 months ago
SeqTrim: a high-throughput pipeline for pre-processing any type of sequence read
Background: High-throughput automated sequencing has enabled an exponential growth rate of sequencing data. This requires increasing sequence quality and reliability in order to a...
Juan Falgueras, Antonio J. Lara, Noé Fern&a...
BMCBI
2004
123views more  BMCBI 2004»
13 years 7 months ago
galaxieEST: addressing EST identity through automated phylogenetic analysis
Background: Research involving expressed sequence tags (ESTs) is intricately coupled to the existence of large, well-annotated sequence repositories. Comparatively complete and sa...
R. Henrik Nilsson, Balaji Rajashekar, Karl-Henrik ...
ITS
2000
Springer
156views Multimedia» more  ITS 2000»
13 years 11 months ago
A Coached Collaborative Learning Environment for Entity-Relationship Modeling
Abstract. We discuss the design of an agent for coaching collaborative learning in a distance learning context. The learning domain is entity-relationship modeling, a domain in whi...
María de los Angeles Constantino-Gonz&aacut...
SIAMJO
2011
13 years 2 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye