Sciweavers

3466 search results - page 60 / 694
» Fast computation of special resultants
Sort
View
ICCV
2005
IEEE
14 years 4 months ago
Fast Texture-Based Tracking and Delineation Using Texture Entropy
We propose a fast texture-segmentation approach to the problem of 2-D and 3–D model-based contour tracking, which is suitable for real-time or interactive applications. Our appr...
Ali Shahrokni, Tom Drummond, Pascal Fua
COMPGEOM
2004
ACM
14 years 2 months ago
Complete, exact, and efficient computations with cubic curves
The Bentley-Ottmann sweep-line method can be used to compute the arrangement of planar curves provided a number of geometric primitives operating on the curves are available. We d...
Arno Eigenwillig, Lutz Kettner, Elmar Schömer...
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 11 months ago
Accelerating Scientific Computations with Mixed Precision Algorithms
On modern architectures, the performance of 32-bit operations is often at least twice as fast as the performance of 64-bit operations. By using a combination of 32-bit and 64-bit ...
Marc Baboulin, Alfredo Buttari, Jack Dongarra, Jak...
EUROCRYPT
2010
Springer
14 years 4 months ago
Computational Soundness, Co-induction, and Encryption Cycles
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
Daniele Micciancio
COSIT
2001
Springer
186views GIS» more  COSIT 2001»
14 years 3 months ago
Computational Structure in Three-Valued Nearness Relations
The development of cognitively plausible models of human spatial reasoning may ultimately result in computational systems that are better equipped to meet human needs. This paper e...
Matt Duckham, Michael F. Worboys