Results 1 - 10
of
467
Memory-optimal evaluation of expression trees involving large objects
- In Proc. Intl. Conf. on High Perf. Comp
, 1999
"... Abstract. The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects are very large that only a subset of them can fit in memory at a time. This paper addresses the problem of findi ..."
Abstract
-
Cited by 38 (23 self)
- Add to MetaCart
Abstract. The need to evaluate expression trees involving large objects arises in scientific computing applications such as electronic structure calculations. Often, the tree node objects are very large that only a subset of them can fit in memory at a time. This paper addresses the problem
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
phase is sufficiently smooth so as to endure map refinement largely unaltered. On the other hand, it offers the advantage of being more reliable in clearing modulus object contrast from raw maps. This is because a body coil reference cannot be acquired quite simultaneously with the array reference
Dynamic Memory Usage Optimization using ILP
"... In this paper, we address the problem of memory usage optimization in the evaluation of data-dependent program regions involving large data objects. We are interested in situations where the data objects are so large to fit in memory that they have to be dynamically allocated and deallocated during ..."
Abstract
- Add to MetaCart
In this paper, we address the problem of memory usage optimization in the evaluation of data-dependent program regions involving large data objects. We are interested in situations where the data objects are so large to fit in memory that they have to be dynamically allocated and deallocated during
Optimal Evaluation of Fortran-90 Array Expressions for Distributed Memory Machines
, 1992
"... The owner-computes strategy has been used for evaluation of Fortran-90 array expressions on distributed memory machines. This strategy simplifies code generation but is often expensive in terms of the total communication cost and size of temporary memory required for its implementation. In this pape ..."
Abstract
- Add to MetaCart
. The communication tree is introduced as a useful representation for array expressions involving associative and commutative operators of one kind. Procedures for estimating communication and temporary memory costs for a communication tree are described. An efficient polynomial-time algorithm to determine
Tree Logical Classes for Efficient Evaluation of XQuery
- In Proc. SIGMOD Conference
, 2004
"... XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challeng-ing to develop a bulk algebra, which typically manipulates sets of objects with identical structure. A set of XML elements, say of type book, may have members that var ..."
Abstract
-
Cited by 46 (4 self)
- Add to MetaCart
the heterogeneity arising in XML query processing, while avoiding redundant work. We present an algorithm to obtain a TLC algebra expression from an XQuery statement (for a large fragment of XQuery). We show how to implement the TLC algebra effi-ciently, introducing the nest-join as an important physical operator
Evaluating Composite Events using Shared Trees
- IEE Proceedings — Software
, 2001
"... Distributed and concurrent systems tend to generate large numbers of events which require further processing, such as filtering and establishment of co-relations, in order to become useful for human or automated managers. This work focuses on the detection of composite events defined through event e ..."
Abstract
-
Cited by 14 (0 self)
- Add to MetaCart
expressions involving primitive events and some operators: boolean conjunction and disjunction; sequence, repetition, and absolute, periodic and relative timer events. A concrete result of this work was the design and implementation of a general-purpose Event Processing Service (EPS) which may be used
Party over Policy: The Dominating Impact of Group Influence
- on Political Beliefs.’’ Journal of Personality and Social Psychology
, 2003
"... Four studies demonstrated both the power of group influence in persuasion and people's blindness to it. Even under conditions of effortful processing, attitudes toward a social policy depended almost exclusively upon the stated position of one's political party. This effect overwhelmed th ..."
Abstract
-
Cited by 86 (7 self)
- Add to MetaCart
of the emotional expressions of others One aspect of this definitional process involves the factual qualities ascribed to the attitude object Another aspect of this definitional process involves the moral qualities highlighted in the object (see As the foregoing discussion implies, attitudes do not follow from
Adaptive Distributed Monitoring with Accuracy Objectives
- In proc. ACM SIGCOMM workshop on Internet Network Management (INM’06
, 2006
"... We present A-GAP, a novel protocol for continuous monitoring of network state variables, which aims at achieving a given monitoring accuracy with minimal overhead. Network state variables are computed from device counters using aggregation functions, such as SUM, AVERAGE and MAX. The accuracy object ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
objective is expressed as the average estimation error. A-GAP is decentralized and asynchronous to achieve robustness and scalability. It executes on an overlay that interconnects management processes on the devices. On this overlay, the protocol maintains a spanning tree and updates the network state
Author manuscript, published in "ICDT (2012) 46-60" Highly Expressive Query Languages for Unordered Data Trees ∗
, 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract
- Add to MetaCart
We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay
Results 1 - 10
of
467