564 search results - page 58 / 113 » Some Results on the Expressive Power and Complexity of LSCs |
VLDB
1987
ACM
15 years 1 months ago
1987
ACM
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more cl...
PODS
2007
ACM
15 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
121
click to vote
ICDE
2012
IEEE
13 years 8 days ago
2012
IEEE
—Many companies now routinely run massive data analysis jobs – expressed in some scripting language – on large clusters of low-end servers. Many analysis scripts are complex ...
IWPC
2007
IEEE
15 years 4 months ago
2007
IEEE
Java developers often use decompilers to aid reverse engineering and obfuscators to prevent it. Decompilers translate low-level class files to Java source and can produce “good...