Sciweavers

882 search results - page 42 / 177
» On self-embeddings of computable linear orderings
Sort
View
BIRTHDAY
2000
Springer
15 years 2 months ago
Bistructures, bidomains, and linear logic
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
Pierre-Louis Curien, Gordon D. Plotkin, Glynn Wins...
DATE
2006
IEEE
107views Hardware» more  DATE 2006»
15 years 3 months ago
Time domain model order reduction by wavelet collocation method
In this paper, a wavelet based approach is proposed for the model order reduction of linear circuits in time domain. Compared with Chebyshev reduction method, the wavelet reductio...
Xuan Zeng, Lihong Feng, Yangfeng Su, Wei Cai, Dian...
DAC
2007
ACM
15 years 10 months ago
Beyond Low-Order Statistical Response Surfaces: Latent Variable Regression for Efficient, Highly Nonlinear Fitting
The number and magnitude of process variation sources are increasing as we scale further into the nano regime. Today's most successful response surface methods limit us to lo...
Amith Singhee, Rob A. Rutenbar
LICS
2007
IEEE
15 years 4 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
15 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur