Sciweavers

181 search results - page 26 / 37
» On Quantification with A Finite Universe
Sort
View
BSL
2000
153views more  BSL 2000»
13 years 7 months ago
Combinatorics with definable sets: Euler characteristics and Grothendieck rings
We recall the notions of weak and strong Euler characteristics on a first order structure and make explicit the notion of a Grothendieck ring of a structure. We define partially or...
Jan Krajícek, Thomas Scanlon
JIFS
2002
60views more  JIFS 2002»
13 years 7 months ago
Turing's analysis of computation and artificial neural networks
A novel way to simulate Turing Machines (TMs) by Artificial Neural Networks (ANNs) is proposed. We claim that the proposed simulation is in agreement with the correct interpretatio...
Wilson Rosa de Oliveira, Marcílio Carlos Pe...
COLING
2010
13 years 2 months ago
Finite-state Scriptural Translation
We use robust and fast Finite-State Machines (FSMs) to solve scriptural translation problems. We describe a phonetico-morphotactic pivot UIT (universal intermediate transcription)...
M. G. Abbas Malik, Christian Boitet, Pushpak Bhatt...
JOTA
2010
104views more  JOTA 2010»
13 years 2 months ago
Structure and Weak Sharp Minimum of the Pareto Solution Set for Piecewise Linear Multiobjective Optimization
Abstract. In this paper the Pareto solution set of a piecewise linear multiobjective optimization problem in a normed space is shown to be a union of finitely many semiclosed polyh...
X. Q. Yang, N. D. Yen
ADBIS
2010
Springer
333views Database» more  ADBIS 2010»
13 years 9 months ago
Horizontal Partitioning by Predicate Abstraction and Its Application to Data Warehouse Design
al Partitioning by Predicate Abstraction and its Application to Data Warehouse Design Aleksandar Dimovski1 , Goran Velinov2 , and Dragan Sahpaski2 1 Faculty of Information-Communic...
Aleksandar Dimovski, Goran Velinov, Dragan Sahpask...