Sciweavers

8838 search results - page 403 / 1768
» Generalizing Domain Theory
Sort
View
TOCL
2008
128views more  TOCL 2008»
15 years 6 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
ICIP
2009
IEEE
15 years 4 months ago
Geometrical plenoptic sampling
In this paper, we present a general framework for analysis of plenoptic sampling by investigating the spectral analysis of plenoptic imaging. The proposed framework provides a uni...
Chong Chen, Dan Schonfeld
FOGA
2011
14 years 10 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
CGF
2008
126views more  CGF 2008»
15 years 7 months ago
From Web Data to Visualization via Ontology Mapping
In this paper, we propose a novel approach for automatic generation of visualizations from domain-specific data available on the web. We describe a general system pipeline that co...
O. Gilson, N. Silva, Phil W. Grant, Min Chen
MOC
2002
144views more  MOC 2002»
15 years 6 months ago
Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
Abstract. We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as spe...
Xue-Cheng Tai, Paul Tseng