5100 search results - page 922 / 1020 » The Linear Complexity of a Graph |
163
Voted
ISCI
2008
15 years 4 months ago
2008
This paper considers nonlinear modeling based on a limited amount of experimental data and a simulator built from prior knowledge. The problem of how to best incorporate the data ...
137
click to vote
CONSTRAINTS
2007
15 years 4 months ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
121
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We introduce S-DUDE, a new algorithm for denoising Discrete Memoryless Channel (DMC)-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Univer...
135
Voted
ENTCS
2007
15 years 4 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
169
Voted
SMA
2008
ACM
15 years 4 months ago
2008
ACM
We present an alternative approach to standard geometric shape editing using physically-based simulation. With our technique, the user can deform complex objects in real-time. The...