2767 search results - page 240 / 554 » Universal Exponentiation Algorithm |
208
click to vote
ASIAMS
2007
IEEE
16 years 24 days ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
158
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
185
Voted
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
191
click to vote
MCS
2005
Springer
15 years 12 months ago
2005
Springer
Mixed Group Ranks is a parametric method for combining rank based classi ers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
205
Voted
CVPR
2008
IEEE
16 years 11 months ago
2008
IEEE
Color information can be used as a basic and crucial cue for finding correspondence in a stereo matching algorithm. In a real scene, however, image colors are affected by various g...