Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
38
PDF hosted at the Radboud Repository of the Radboud University
"... Please be advised that this information was generated on 2016-05-12 and may be subject to change. ..."
Abstract
- Add to MetaCart
Please be advised that this information was generated on 2016-05-12 and may be subject to change.
Akademisk avhandling för teknisk doktorsexamen vid
, 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract
- Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where
ANY-TIME FUZZY CONTROLLER
, 2006
"... Fuzzy logic has been successfully applied in various fields. However, as fuzzy controllers increase in size and complexity, the number of control rules increases exponentially and real-time behavior becomes more difficult. This thesis introduces an any-time fuzzy controller. Much work has been done ..."
Abstract
- Add to MetaCart
of fuzzy control. Popular aggregation and defuzzification methods (max-min, sum-product, MOM and COG) are first shown to satisfy these constraints, and then three linearization methods are presented. Linearization methods are used to reorder fuzzy rules base such that a reordered rule base would result
Collapsing three-manifolds under a lower curvature bound
- J. Differential Geom
"... Abstract The purpose of this paper is to completely characterize the topology of threedimensional Riemannian manifolds with a uniform lower bound of sectional curvature which converges to a metric space of lower dimension. Introduction We study the topology of three-dimensional Riemannian manifolds ..."
Abstract
-
Cited by 30 (3 self)
- Add to MetaCart
) to the convergence This determines the topology of B i and C i and proves Theorem 0.5. collapsing three-manifolds 9 Preliminaries In this section, we present some results on Alexandrov spaces and the Gromov-Hausdorff convergence related with Alexandrov spaces, which will be needed in the subsequent sections. We
Approved by:
, 2006
"... ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested ..."
Abstract
- Add to MetaCart
ii iii CHRISTOPHER CHARLES WEIGLE: Displays for Exploration and Comparison of Nested
c ○ 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Geometric Methods for Shape Recovery from Line Drawings of Polyhedra
"... Abstract. Using structural geometric arguments, Whiteley showed that a line drawing is a correct projection of a spherical polyhedron if and only if it has a cross-section compatible with it. We here enlarge the class of drawings to which this test applies, including those of polyhedral disks, possi ..."
Abstract
- Add to MetaCart
, possibly with perforations. This extension is helpful, as it makes the test applicable to verify and reconstruct drawings from usual scenes with opaque objects. The presented results rely on geometric constructions, thus offering an alternative approach to line drawing interpretation, complementary
New Techniques for Geographic Routing
, 2006
"... As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but ..."
Abstract
- Add to MetaCart
As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties.
MACNEILLE COMPLETIONS OF MODAL ALGEBRAS JOHN HARDING AND GURAM BEZHANISHVILI
"... Abstract. For a modal algebra (B, f), there are two natural ways to ex-tend f to an operation on the MacNeille completion of B. The resulting structures are called the lower and upper MacNeille completions of (B, f). In this paper we consider lower and upper MacNeille completions for vari-ous variet ..."
Abstract
- Add to MetaCart
Abstract. For a modal algebra (B, f), there are two natural ways to ex-tend f to an operation on the MacNeille completion of B. The resulting structures are called the lower and upper MacNeille completions of (B, f). In this paper we consider lower and upper MacNeille completions for vari
Results 1 - 10
of
38
