106 search results - page 11 / 22 » Light Logics and Optimal Reduction: Completeness and Complex... |
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
JEI
2006
13 years 7 months ago
2006
We propose a fuzzy logic recursive scheme for motion detection and spatiotemporal filtering that can deal with the Gaussian noise and unsteady illumination conditions in both the t...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— In upstream vectored DSL transmission, the far-end crosstalk (FEXT) can be completely cancelled by using zeroforcing generalized decision-feedback equalizers (ZF-GDFE). When th...
SBCCI
2009
ACM
14 years 2 days ago
2009
ACM
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...