Sciweavers

424 search results - page 26 / 85
» Realizability models and implicit complexity
Sort
View
CG
2002
Springer
13 years 7 months ago
Analytical methods for polynomial weighted convolution surfaces with various kernels
Convolution surface has the advantage of being crease-free and bulge-free over other kinds of implicit surfaces. Among the various types of skeletal elements, line segments can be...
Xiaogang Jin, Chiew-Lan Tai
ICIP
2009
IEEE
13 years 5 months ago
Genetic algorithms for 3d reconstruction with supershapes
Supershape model is a recent primitive that represents numerous 3D shapes with several symmetry axes. The main interest of this model is its capability to reconstruct more complex...
Sophie Voisin, Mongi A. Abidi, Sebti Foufou, Fr&ea...
SAC
2008
ACM
13 years 7 months ago
Collaborative software engineering on large-scale models: requirements and experience in ModelBus
This work presents an approach for realizing Model-Driven software engineering in the distributed and multi-developers context. It particularly focuses on the scalability problems...
Prawee Sriplakich, Xavier Blanc, Marie-Pierre Gerv...
KER
2008
134views more  KER 2008»
13 years 7 months ago
A review of current defeasible reasoning implementations
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
Daniel Bryant, Paul J. Krause
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
14 years 1 months ago
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
Ngai Wong