835 search results - page 61 / 167 » Characterizing rosy theories |
152
Voted
MOC
1998
15 years 5 months ago
1998
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
185
click to vote
ACSD
2009
IEEE
16 years 29 days 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 (...
151
click to vote
LATA
2010
Springer
16 years 19 days ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
143
click to vote
CDC
2008
IEEE
16 years 19 days ago
2008
IEEE
Abstract— The problem of exact null-controllability is considered for a wide class of linear neutral type systems with distributed delay. The main tool of the analysis is the app...
163
click to vote
INFOCOM
2008
IEEE
16 years 17 days ago
2008
IEEE
—Providing anonymity to routes in a wireless ad hoc network from passive eavesdroppers is considered. Using Shannon’s equivocation as an information theoretic measure of anonym...