Sciweavers

6045 search results - page 190 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
GMP
2010
IEEE
175views Solid Modeling» more  GMP 2010»
14 years 16 days ago
Optimal Analysis-Aware Parameterization of Computational Domain in Isogeometric Analysis
Abstract. In isogeometric analysis (IGA for short) framework, computational domain is exactly described using the same representation as that employed in the CAD process. For a CAD...
Gang Xu, Bernard Mourrain, Régis Duvigneau,...
CAD
2011
Springer
13 years 3 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...
EUROCRYPT
2011
Springer
12 years 11 months ago
Semi-homomorphic Encryption and Multiparty Computation
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
Rikke Bendlin, Ivan Damgård, Claudio Orlandi...
CVPR
2007
IEEE
14 years 10 months ago
A Human Action Recognition System for Embedded Computer Vision Application
In this paper, we propose a human action recognition system suitable for embedded computer vision applications in security systems, human-computer interaction and intelligent envi...
Hongying Meng, Nick Pears, Chris Bailey
DAC
2006
ACM
14 years 9 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...