Sciweavers

16430 search results - page 546 / 3286
» On Computable Tree Functions
Sort
View
CIE
2009
Springer
15 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
156
Voted
AISC
2008
Springer
15 years 9 months ago
Automating Side Conditions in Formalized Partial Functions
Abstract. Assumptions about the domains of partial functions are necessary in state-of-the-art proof assistants. On the other hand when mathematicians write about partial functions...
Cezary Kaliszyk
ICANN
2010
Springer
15 years 7 months ago
Solving Independent Component Analysis Contrast Functions with Particle Swarm Optimization
Independent Component Analysis (ICA) is a statistical computation method that transforms a random vector in another one whose components are independent. Because the marginal distr...
Jorge Igual, Jehad I. Ababneh, Raul Llinares, Juli...
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 7 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
ACL
2009
15 years 4 months ago
Topological Ordering of Function Words in Hierarchical Phrase-based Translation
Hierarchical phrase-based models are attractive because they provide a consistent framework within which to characterize both local and long-distance reorderings, but they also ma...
Hendra Setiawan, Min-Yen Kan, Haizhou Li, Philip R...