Sciweavers

5344 search results - page 379 / 1069
» Privacy-Preserving Set Operations
Sort
View
158
Voted
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
15 years 4 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
LOGCOM
2002
100views more  LOGCOM 2002»
15 years 4 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
IPMU
2010
Springer
15 years 3 months ago
Attribute Value Selection Considering the Minimum Description Length Approach and Feature Granularity
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Kemal Ince, Frank Klawonn
JUCS
2010
100views more  JUCS 2010»
15 years 3 months ago
A Pragmatic Qualitative Approach for Juxtaposing Shapes
: This paper presents a qualitative shape description scheme which has been defined in order to have a formal theory to allow the construction of new shapes from a set of given sha...
Lledó Museros Cabedo, Luis González ...
MSCS
2010
104views more  MSCS 2010»
15 years 3 months ago
A note on accelerated Turing machines
ABSTRACT. In this note we prove that any Turing machine which uses only a finite computational space for every input cannot solve an uncomputable problem even in case it runs in a...
Cristian S. Calude, Ludwig Staiger