2370 search results - page 51 / 474 » The Characterization of Data-Accumulating Algorithms |
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Wireless Sensor Networks are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power. On the other hand...
126
click to vote
APWEB
2011
Springer
14 years 4 months ago
2011
Springer
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
104
click to vote
ECCV
2000
Springer
15 years 2 months ago
2000
Springer
A new approach to characterizing the performance of point-correspondence algorithms is presented. Instead of relying on any \ground truth', it uses the self-consistency of th...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Running several sub-optimal algorithms and choosing the optimal one is a common procedure in computer science, most notably in the design of approximation algorithms. This paper d...
NIPS
2008
14 years 11 months ago
2008
This paper examines the generalization properties of online convex programming algorithms when the loss function is Lipschitz and strongly convex. Our main result is a sharp bound...