Sciweavers

953 search results - page 129 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
BMCBI
2006
112views more  BMCBI 2006»
13 years 8 months ago
GENOMEMASKER package for designing unique genomic PCR primers
Background: The design of oligonucleotides and PCR primers for studying large genomes is complicated by the redundancy of sequences. The eukaryotic genomes are particularly diffic...
Reidar Andreson, Eric Reppo, Lauris Kaplinski, Mai...
FGCS
2007
142views more  FGCS 2007»
13 years 8 months ago
Fault tolerant high performance Information Services for dynamic collections of Grid and Web services
Abstract. E-Science Semantic Grids can often be thought of as dynamic collection of semantic subgrids where each subgrid is a collection of modest number of services that assembled...
Mehmet S. Aktas, Geoffrey Fox, Marlon E. Pierce
PVLDB
2008
124views more  PVLDB 2008»
13 years 7 months ago
Google's Deep Web crawl
The Deep Web, i.e., content hidden behind HTML forms, has long been acknowledged as a significant gap in search engine coverage. Since it represents a large portion of the structu...
Jayant Madhavan, David Ko, Lucja Kot, Vignesh Gana...
SIGSOFT
2004
ACM
14 years 8 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
ICCAD
2002
IEEE
124views Hardware» more  ICCAD 2002»
14 years 5 months ago
Symbolic pointer analysis
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...
Jianwen Zhu