Sciweavers

4047 search results - page 104 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
DM
2008
77views more  DM 2008»
15 years 3 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh
ISIPTA
2003
IEEE
120views Mathematics» more  ISIPTA 2003»
15 years 9 months ago
Reliability Analysis in Geotechnics with Finite Elements --- Comparison of Probabilistic, Stochastic and Fuzzy Set Methods
The finite element method is widely used for solving various problems in geotechnical engineering practice. The input parameters required for the calculations are generally impre...
Gerd M. Peschl, H. F. Schweiger
WOLLIC
2009
Springer
15 years 11 months ago
Recognizability in the Simply Typed Lambda-Calculus
Abstract. We define a notion of recognizable sets of simply typed λterms that extends the notion of recognizable sets of strings or trees. This definition is based on finite mo...
Sylvain Salvati
FSTTCS
2006
Springer
15 years 8 months ago
Branching Pushdown Tree Automata
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
Rajeev Alur, Swarat Chaudhuri
CORR
2010
Springer
198views Education» more  CORR 2010»
15 years 1 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...