Sciweavers

1445 search results - page 15 / 289
» Uniformly Hard Languages
Sort
View
VMCAI
2007
Springer
15 years 10 months ago
Constructing Specialized Shape Analyses for Uniform Change
Abstract. This paper is concerned with one of the basic problems in abstract interpretation, namely, for a given abstraction and a given set of concrete transformers (that express ...
Tal Lev-Ami, Mooly Sagiv, Neil Immerman, Thomas W....
DAGSTUHL
1996
15 years 5 months ago
A Uniform Approach for Compile-Time and Run-Time Specialization
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...
Charles Consel, Luke Hornof, François No&eu...
OOPSLA
2004
Springer
15 years 9 months ago
Hard real-time: C++ versus RTSJ
In the domain of hard real-time systems, which language is better: C++ or the Real-Time Specification for Java (RTSJ)? Although standard Java provides a more productive programmin...
Daniel L. Dvorak, William K. Reinholtz
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
16 years 4 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
161
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 4 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...