644 search results - page 53 / 129 » A topological characterization of weakness |
179
click to vote
ALP
1997
Springer
15 years 10 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
187
click to vote
ACSD
2009
IEEE
16 years 1 months ago
2009
IEEE
We propose a general method to characterize and synthesize correctness-preserving, asynchronous wrappers for synchronous processes on a globally asynchronous locally synchronous (...
148
click to vote
ICWE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. The massive amount of textual data on the Web raises numerous classification problems. Although the notion of domain is widely acknowledged in the IR field, the applica...
164
click to vote
ESOP
2001
Springer
15 years 10 months ago
2001
Springer
Equality constraints (unification constraints) have widespread use in program analysis, most notably in static polymorphic type systems. Conditional equality constraints extend eq...
159
click to vote
TCS
2008
15 years 6 months ago
2008
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...