Sciweavers

1016 search results - page 190 / 204
» Evaluation of Expression Recognition Techniques
Sort
View
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
BMCBI
2008
156views more  BMCBI 2008»
13 years 10 months ago
The unique probe selector: a comprehensive web service for probe design and oligonucleotide arrays
Background: Nucleic acid hybridization, a fundamental technique in molecular biology, can be modified into very effective and sensitive methods for detecting particular targets mi...
Shu-Hwa Chen, Chen-Zen Lo, Ming-Chi Tsai, Chao A. ...
SIGSOFT
2002
ACM
14 years 10 months ago
Invariant inference for static checking
Static checking can verify the absence of errors in a program, but often requires written annotations or specifications. As a result, static checking can be difficult to use effec...
Jeremy W. Nimmer, Michael D. Ernst
HPCC
2005
Springer
14 years 3 months ago
Enabling the P2P JXTA Platform for High-Performance Networking Grid Infrastructures
Abstract. As grid sizes increase, the need for self-organization and dynamic reconfigurations is becoming more and more important, and therefore the convergence of grid computing ...
Gabriel Antoniu, Mathieu Jan, David A. Noblet
CIKM
2006
Springer
14 years 1 months ago
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
The wide adoption of XML has increased the interest of the database community on tree-structured data management techniques. Querying capabilities are provided through tree-patter...
Dimitri Theodoratos, Stefanos Souldatos, Theodore ...