Sciweavers

1888 search results - page 57 / 378
» Proof theory and computational analysis
Sort
View
FUIN
2006
103views more  FUIN 2006»
13 years 8 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
SOCIALCOM
2010
13 years 6 months ago
A Methodology for Integrating Network Theory and Topic Modeling and its Application to Innovation Diffusion
Text data pertaining to socio-technical networks often are analyzed separately from relational data, or are reduced to the fact and strength of the flow of information between node...
Jana Diesner, Kathleen M. Carley
CIE
2006
Springer
14 years 7 days ago
Inverting Monotone Continuous Functions in Constructive Analysis
We prove constructively (in the style of Bishop) that every monotone continuous function with a uniform modulus of increase has a continuous inverse. The proof is formalized, and a...
Helmut Schwichtenberg
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
14 years 2 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert