Sciweavers

1712 search results - page 24 / 343
» A Computational Approach to Binding Theory
Sort
View
JCIT
2007
107views more  JCIT 2007»
14 years 11 months ago
A New Approach to Computing Weighted Attributes Values in Incomplete Information Systems
The Rough Sets theory has been conceived to deal with inexact, uncertain or vague knowledge in Information systems. The article is devoted to propose notions including the general...
Tian Hong, Wang Xiukun, Henryk Rybinski
TVCG
2012
179views Hardware» more  TVCG 2012»
13 years 2 months ago
Parallel Computation of 2D Morse-Smale Complexes
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...
ICFP
2010
ACM
15 years 26 days ago
A fresh look at programming with names and binders
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
Nicolas Pouillard, François Pottier
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 5 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
NSPW
2004
ACM
15 years 5 months ago
A qualitative framework for Shannon information theories
This paper presents a new paradigm for information theory which is a synthesis of Barwise-Seligman’s qualitative theory and Shannon’s quantitative theory. The new paradigm is ...
Gerard Allwein