Sciweavers

10819 search results - page 418 / 2164
» Addition and multiplication of sets
Sort
View
TCS
2011
15 years 1 months ago
Correctness of linear logic proof structures is NL-complete
We provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. We use these criteria for proving that deciding the correctness of a...
Paulin Jacobé de Naurois, Virgile Mogbil
ICIP
2005
IEEE
16 years 8 months ago
The multiRANSAC algorithm and its application to detect planar homographies
A RANSAC based procedure is described for detecting inliers corresponding to multiple models in a given set of data points. The algorithm we present in this paper (called multiRAN...
Marco Zuliani, Charles S. Kenney, B. S. Manjunath
161
Voted
WINE
2007
Springer
128views Economy» more  WINE 2007»
16 years 28 days ago
Total Latency in Singleton Congestion Games
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
Martin Gairing, Florian Schoppmann
EUROPAR
2005
Springer
16 years 11 days ago
Automatic Tuning of PDGEMM Towards Optimal Performance
Sophisticated parallel matrix multiplication algorithms like PDGEMM exhibit a complex structure and can be controlled by a large set of parameters including blocking factors and bl...
Sascha Hunold, Thomas Rauber
EUROPAR
2000
Springer
15 years 10 months ago
Automatic SIMD Parallelization of Embedded Applications Based on Pattern Recognition
This paper investigates the potential for automatic mapping of typical embedded applications to architectures with multimedia instruction set extensions. For this purpose a (patter...
Rashindra Manniesing, Ireneusz Karkowski, Henk Cor...