2947 search results - page 557 / 590 » Analyzing Program Analyses |
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
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...
187
Voted
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
The emergence of a large number of bioinformatics datasets on the Internet has resulted in the need for flexible and efficient approaches to integrate information from multiple bio...
189
Voted
SIGMOD
2008
ACM
15 years 11 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
81
Voted
ICCAD
2008
IEEE
15 years 7 months ago
2008
IEEE
— Leveraging the power of scratchpad memories (SPMs) available in most embedded systems today is crucial to extract maximum performance from application programs. While regular a...
ICCAD
2006
IEEE
15 years 7 months ago
2006
IEEE
Although many recent advances have been made in hardware synthesis techniques from software programming languages such as C, the performance of synthesized hardware commonly suffe...