Sciweavers

232 search results - page 29 / 47
» On Characterizing the Data Access Complexity of Programs
Sort
View
BMCBI
2010
117views more  BMCBI 2010»
14 years 11 months ago
Better score function for peptide identification with ETD MS/MS spectra
Background: Tandem mass spectrometry (MS/MS) has become the primary way for protein identification in proteomics. A good score function for measuring the match quality between a p...
Xiaowen Liu, Baozhen Shan, Lei Xin, Bin Ma
CP
2003
Springer
15 years 4 months ago
Using Constraints for Exploring Catalogs
Abstract. Searching objects within a catalog is a problem of increasing importance, as the general public has access to increasing volumes of data. Constraint programming has addre...
François Laburthe, Yves Caseau
PARA
2004
Springer
15 years 4 months ago
Cache Optimizations for Iterative Numerical Codes Aware of Hardware Prefetching
Cache optimizations typically include code transformations to increase the locality of memory accesses. An orthogonal approach is to enable for latency hiding by introducing prefet...
Josef Weidendorfer, Carsten Trinitis
VMCAI
2004
Springer
15 years 4 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
IDA
2008
Springer
14 years 10 months ago
ExpertDiscovery system application for the hierarchical analysis of eukaryotic transcription regulatory regions based on DNA cod
We developed Relational Data Mining approach which allows to overcome essential limitations of the Data Mining and Knowledge Discovery techniques. In the paper the approach was im...
I. V. Khomicheva, Eugenii E. Vityaev, Elena A. Ana...