Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
5 of
5
Soft kinetic data structures
- In SODA ’01: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
"... We introduce the framework of soft kinetic data structures (SKDS). A soft kinetic data structure is an approximate data structure that can be used to answer queries on a set of moving objects with unpredictable motion. We analyze the quality of a soft kinetic data structure by giving a competitive a ..."
Abstract
-
Cited by 8 (0 self)
- Add to MetaCart
We introduce the framework of soft kinetic data structures (SKDS). A soft kinetic data structure is an approximate data structure that can be used to answer queries on a set of moving objects with unpredictable motion. We analyze the quality of a soft kinetic data structure by giving a competitive
Software and Systems Modeling The final publication is available at www.springerlink.com Performance Modeling and Analysis of Message-oriented Event-driven Systems
"... Abstract Message-oriented event-driven systems are becoming increasingly ubiquitous in many industry do-mains including telecommunications, transportation and supply chain management. Applications in these areas typically have stringent requirements for performance and scalability. To guarantee adeq ..."
Abstract
- Add to MetaCart
-by-step fashion and then used to predict the system perfor-mance under various workload and configuration scenar-ios. After the case study, we present a set of generic per-formance modeling patterns that can be used as build-ing blocks when modeling message-oriented event-driven systems. The results demonstrate
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 the group elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.
