Sciweavers

16430 search results - page 2673 / 3286
» On Computable Tree Functions
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
15 years 7 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
CVGIP
2006
116views more  CVGIP 2006»
15 years 7 months ago
Autonomous behaviors for interactive vehicle animations
We present a method for synthesizing animations of autonomous space, water, and land-based vehicles in games or other interactive simulations. Controlling the motion of such vehic...
Jared Go, Thuc D. Vu, James J. Kuffner
CVIU
2006
105views more  CVIU 2006»
15 years 7 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
CAD
2007
Springer
15 years 7 months ago
A B-spline-based approach to heterogeneous objects design and analysis
The recent advancement of solid freeform fabrication, design techniques and fundamental understanding of material properties in functionally graded materials has made it possible ...
Pinghai Yang, Xiaoping Qian
COMGEO
2007
ACM
15 years 7 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
« Prev « First page 2673 / 3286 Last » Next »