Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
330
Isosurfacing in Span Space with Utmost Efficiency (ISSUE)
- In IEEE Visualization ’96
, 1996
"... We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are described. We also present a parallel implementation with an emphasis on load balancing. The performance of our sequential al ..."
Abstract
- Add to MetaCart
We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are described. We also present a parallel implementation with an emphasis on load balancing. The performance of our sequential
PRIMA: Passive Reduced-order Interconnect Macromodeling Algorithm
, 1997
"... This paper describes PRIMA, an algorithm for generating provably passive reduced order N-port models for RLC interconnect circuits. It is demonstrated that, in addition to requiring macromodel stability, macromodel passivity is needed to guarantee the overall circuit stability once the active and pa ..."
Abstract
-
Cited by 429 (10 self)
- Add to MetaCart
accuracy in the frequency domain for all examples considered. Additionally, a path tracing algorithm is used to calculate the reduced order macromodel with the utmost efficiency for generalized RLC interconnects.
BTF image space utmost compression and modelling method
- in Proceedings of 17th International Conference on Pattern Recognition
, 2004
"... The bidirectional texture function (BTF) describes texture appearance variations due to varying illumination and viewing conditions. This function is acquired by large number of measurements for all possible combinations of illumination and viewing positions hence some compressed representation of t ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
of these huge BTF texture data spaces is obviously inevitable. In this paper we present a novel efficient probabilistic model-based method for multispectral BTF texture compression which simultaneously allows its efficient modelling. This representation model is capable of seamless BTF space enlargement
UTMOST: A Traffic Modeling Tool for Wireless Network Design
, 1997
"... In this paper we present the design and implementation of a user traffic modeling and simulation tool for wireless network design. It has a graphical user interface for displaying the cell layout, user traversing patterns, the current power and cell site assignments. For each simulation step, it gen ..."
Abstract
- Add to MetaCart
the verification of the assignment results. It outputs event traces to drive discrete event simulators for the cell size determination and the comparison of efficient handoff algorithms. 1. Introduction The Colorado Advanced Software Institute (CASI) in conjunction with US West has provided us a grant to work
Gesture recognition: A survey
- IEEE TRANSACTIONS ON SYSTEMS, MAN AND CYBERNETICS - PART C
, 2007
"... Gesture recognition pertains to recognizing meaningful expressions of motion by a human, involving the hands, arms, face, head, and/or body. It is of utmost importance in designing an intelligent and efficient human–computer interface. The applications of gesture recognition are manifold, ranging fr ..."
Abstract
-
Cited by 200 (0 self)
- Add to MetaCart
Gesture recognition pertains to recognizing meaningful expressions of motion by a human, involving the hands, arms, face, head, and/or body. It is of utmost importance in designing an intelligent and efficient human–computer interface. The applications of gesture recognition are manifold, ranging
An Efficient Meta-lock for Implementing Ubiquitous Synchronization
, 1999
"... Programs written in concurrent object-oriented languages, espe-cially ones that employ thread-safe reusable class libraries, can execute synchronization operations (lock, notify, etc.) at an amaz-ing rate. Unless implemented with utmost care, synchronization can become a performance bottleneck. Furt ..."
Abstract
-
Cited by 76 (2 self)
- Add to MetaCart
Programs written in concurrent object-oriented languages, espe-cially ones that employ thread-safe reusable class libraries, can execute synchronization operations (lock, notify, etc.) at an amaz-ing rate. Unless implemented with utmost care, synchronization can become a performance bottleneck
The potential of the cell processor for scientific computing,”
- in Proceedings of the third conference on Computing Frontiers,
, 2006
"... The slowing pace of commodity microprocessor performance improvements combined with everincreasing chip power demands has become of utmost concern to computational scientists. As a result, the high performance computing community is examining alternative architectures that address the limitations o ..."
Abstract
-
Cited by 96 (7 self)
- Add to MetaCart
The slowing pace of commodity microprocessor performance improvements combined with everincreasing chip power demands has become of utmost concern to computational scientists. As a result, the high performance computing community is examining alternative architectures that address the limitations
TETA: Transistor-Level Engine for Timing Analysis
- Proceedings of the Design Automation Conference
, 1998
"... TETA is an interconnect-centric waveform calculator that was optimized to achieve the utmost efficiency for analyzing logic stages comprised of transistors and large coupled RC(L) interconnect models. TETA applies a novel compaction for the transistor clusters and employs successive chord iterat ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
TETA is an interconnect-centric waveform calculator that was optimized to achieve the utmost efficiency for analyzing logic stages comprised of transistors and large coupled RC(L) interconnect models. TETA applies a novel compaction for the transistor clusters and employs successive chord
An Analysis of Case-Based Value Function Approximation by Approximating State Transition Graphs
"... Abstract. We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link concerns the utmost efficient exploitation of experience the agent has collected by interacting within its enviro ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Abstract. We identify two fundamental points of utilizing CBR for an adaptive agent that tries to learn on the basis of trial and error without a model of its environment. The first link concerns the utmost efficient exploitation of experience the agent has collected by interacting within its
From Learning Models of Natural Image Patches to Whole Image Restoration
"... Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can lead to tremendous computational challenges. In contrast, when we work with small image patches, it is possible to learn ..."
Abstract
-
Cited by 77 (1 self)
- Add to MetaCart
Learning good image priors is of utmost importance for the study of vision, computer vision and image processing applications. Learning priors and optimizing over whole images can lead to tremendous computational challenges. In contrast, when we work with small image patches, it is possible
Results 1 - 10
of
330
