|
|
Creator | Title | Description | Subject | Date |
| 401 |
 |
Zhang, Chengqiang | Hardware-only stream prediction + cache prefetching + dynamic access ordering | The speed gap between processors and memory system is becoming the performance bottleneck for many applications, and computations with strided access patterns are among those that suffer most. The vectors used in such applications lack temporal and often spatial locality, and are usually too large t... | Speed gap; Stream prediction; Cache prefetching; Dynamic access ordering | 1999 |
| 402 |
 |
Brunvand, Erik L. | HDL modeling for analysis and optimization of asynchronous controllers | We propose a simulation-based technique for analysis and optimization of extended burst-mode (XBM) asynchronous controllers. In asynchronous controllers of this sort, timing information on control signals is significant both for performance enhancement and timing validation. Timing information, ... | | 2005 |
| 403 |
 |
Bhatia, Harsh; Jadhav, Shreeraj Digambar; Norgard, Greg; Bremer, Peer-Timo; Pascucci, Valerio | Helmholtz-Hodge Decomposition of vector fields on 2-manifolds | A Morse-like Decomposition ? - Morse-Smale decomposition for gradient (of scalar) fields is an interesting way of decomposing the domain into regions of unidirectional flow (from a source to a sink ). - But works for gradient fields, which are conservative (irrotational), only. - Can such a de... | | |
| 404 |
 |
Regehr, John | Help, help, Im being suppressed the significance of suppressors in software testing | Abstract-Test features are basic compositional units used to describe what a test does (and does not) involve. For example, in API-based testing, the most obvious features are function calls; in grammar-based testing, the obvious features are the elements of the grammar. The relationship between fea... | | 2013-01-01 |
| 405 |
 |
Cohen, Elaine | Hidden curve removal for free form surfaces | This paper describes a hidden curve algorithm specifically designed for sculptured surfaces. A technique is described to extract the visible curves for a given scene without the need to approximate the surface by polygons. This algorithm produces higher quality results than polygon based algorithms,... | Hidden curves; Free form surfaces; Sculptured surfaces | 1989 |
| 406 |
 |
Archuleta, Michael | Hidden surface line drawing algorithm | This paper describes a fast procedure in processing hidden surface pictures with the output in vector form. The program has been written expressly for a Decsystem 10 and has performed successfully on three different installations. The algorithm which is being used is a modification to the Watkins' A... | Watkins algorithm; Hidden surface | 1972 |
| 407 |
 |
Gopalakrishnan, Ganesh | Hierarchical action refinement: a methodology for compiling asynchronous circuits from a concurrent HDL | A hardware specification formalism called hopCP is introduced, hopCP provides an uniform notation t o describe the causal relationships between a set of nonatomic actions which capture the computational, concurrency, control and communication aspects of hardware behavior. A systematic approach to sy... | Hierarchical action refinement; Hardware specification formalism; hopCP | 1991 |
| 408 |
 |
Weinstein, David | Hierarchical data structures for interactive volume visualization | In order to interactively investigate large-scale 3D data sets, we propose an improved hierarchical data structure for structured grids and an original hierarchical d a t a structure for unstructured grids. These multi-tiered implementations allow the user to interactively control both the local and... | Hierarchical data structures; Volume visualization; 3D data sets | 1995 |
| 409 |
 |
Regehr, John | Hierarchical schedulers, performance guarantees, and resource management | An attractive approach to scheduling applications with diverse CPU scheduling requirements is to use different schedulers for different applications. For example: real-time schedulers allow applications to perform computations before deadlines, time-sharing schedulers provide high throughput for com... | | 1999-01-01 |
| 410 |
 |
Gopalakrishnan, Ganesh | High level optimizations in compiling process descriptions to asynchronous circuits | Asynchronous/'Self-Timed designs are beginning to attract attention as promising means of dealing with the complexity of modern VLSI technology. In this paper, we present our views on why asynchronous systems matter. We then present details of our high level synthesis tool SHILPA that can automatic... | Self-timed; VLSI | 1992 |
| 411 |
 |
Frost, Richard L. | High resolution astronomical imaging through the turbulent atmosphere | This research is principally concerned with the digital reconstruction of star images observed with large ground-based telescopes, although the techniques developed here will have application to a broad class of reconstruction problems. Since the work of Labeyrie, the difficulty in producing accurat... | Astronomical imaging; Turbulent atmosphere; Digital reconstruction; Star images | 1979 |
| 412 |
 |
Brunvand, Erik L. ; Gopalakrishnan, Ganesh | High-level asynchronous system design using the ACK framework | Designing asynchronous circuits is becoming easier as a number of design styles are making the transition from research projects to real, usable tools. However, designing asynchronous "systems" is still a difficult problem. We define asynchronous systems to be medium to large digital systems whose... | | 2000 |
| 413 |
 |
Henderson, Thomas C. | High-level planning for dextrous manipulation | The development of mechanical end effectors capable of dextrous manipulation is a rapidly growing and quite successful field of research. It has in some sense put the focus on control issues, in particular, how to control these remarkably anthropomorphic manipulators to perform the deft movement tha... | Mechanical end effectors; Dextrous manipulation | 1987 |
| 414 |
 |
Kasera, Sneha K.; Patwari, Neal | High-rate uncorrelated bit extraction for shared secret key generation from channel measurements | Secret keys can be generated and shared between two wireless nodes by measuring and encoding radio channel characteristics without ever revealing the secret key to an eavesdropper at a third location. This paper addresses bit extraction, i.e., the extraction of secret key bits from noisy radio chan... | Wireless networks; Multipath fading; Physical layer; Key generation; Secret keys; Bit extraction | 2010-01 |
| 415 |
 |
Awate, Suyash P.; Whitaker, Ross T. | Higher-order image statistics for unsupervised, information-theoretic, adaptive, image filtering | The restoration of images is an important and widely studied problem in computer vision and image processing. Various image filtering strategies have been effective, but invariably make strong assumptions about the properties of the signal and/or degradation. Therefore, these methods typically la... | Image filtering; Image restoration | 2005-04-15 |
| 416 |
 |
Tasdizen, Tolga; Whitaker, Ross T. | Higher-order nonlinear priors for surface reconstruction | For surface reconstruction problems with noisy and incomplete range data, a Bayesian estimation approach can improve the overall quality of the surfaces. The Bayesian approach to surface estimation relies on a likelihood term, which ties the surface estimate to the input data, and the prior, whic... | Surface reconstruction; Bayesian approach; Nonlinear prior | 2002-12-09 |
| 417 |
 |
Regehr, John | HLS: a framework for composing soft real-time schedulers | Hierarchical CPU scheduling has emerged as a way to (1) support applications with diverse scheduling requirements in open systems, and (2) provide load isolation between applications, users, and other resource principals. Most existing work on hierarchical scheduling has focused on systems that prov... | | 2001-01-01 |
| 418 |
 |
Gopalakrishnan, Ganesh | HOP: A formal model for synchronous circuits using communicating fundamental mode symbolic automata | We study synchronous digital circuits in an abstract setting. A circuit is viewed as a collection of modules connected through their boundary ports, where each port assumes a fixed direction (input or output) over one cycle of operation, and can change directions across cycles. No distinction is ma... | HOP | 1992 |
| 419 |
 |
Gopalakrishnan, Ganesh | HOP: a process model for synchronous hardware semantics, and experiments in process composition | We present a language "Hardware viewed as Objects and Processes" (HOP) for specifying the structure, behavior, and timing of hardware systems. HOP embodies a simple process model for lock-step synchronous processes. An absproc specification written in HOP describes the externally observable behavior... | HOP; Synchronous hardware semantics | 1988 |
| 420 |
 |
Gopalakrishnan, Ganesh | HOP: a process model for synchronous hardware systems | Modules in HOP are black-boxes that are understood and used only in terms of their interface. The interface consists of d a t a ports, events, and a protocol specification that uses events and asserts/queries values to / from ports. Events are realized as different combinations of control wires or... | HOP; Process models; Synchronous hardware systems | 1988 |
| 421 |
 |
Gopalakrishnan, Ganesh | hopCP: A concurrent hardware description language | hopCP is a language for the specification, simulation, and synthesis of hardware systems. hopCP captures the behavior of a hardware system by specifying the causal relationships between actions that the system can perform. No specific timing discipline is implied by a hopCP specification. Hence, hop... | hopCP; Hardware systems | 1991 |
| 422 |
 |
Akella, Venkatesh | hopCP: language definition, semantics and examples | We describe a formalism for high level modeling of hardware based on flow graphs and nonatomic actions called hopCP. A module is the description of a hardware system in hopCP, which contains a flow graph to model the behavioral aspects and ports which represent the communication links. Operations ar... | hopCP | 1990 |
| 423 |
 |
Regehr, John | How to rapidly prototype a real-time scheduler | Implementing a new scheduling algorithm in an OS kernel is often an important step in scheduling research because it permits evaluation of the algorithm's performance on real workloads. However, developing a new scheduler is not a trivial task because it requires sophisticated programming skills and... | | 2002-01-01 |
| 424 |
 |
Gu, Jun | How to search for millions of queens | The n-queens problem is a classical combinatorial problem in artificial intelligence (AI) area. Since its simplicity and regular structure, this problem has widely been chosen as a testbed to develop and benchmark new AI search problem-solving strategies in the AI community. Due to its inherent com... | Combinatorial problems; n-queens; Search algorithms | 1988 |
| 425 |
 |
Cohen, Elaine | Hybrid symbolic and numeric operators as tools for analysis of freeform surfaces | Freeform surfaces are commonly used in Computer Aided Geometric Design?? so accurate analysis of surface properties is becoming increasingly important In this paper we de ne surface slope and surface speed?? develop visualization tools?? and demonstrate that they can be useful in the design proc... | Freeform surfaces | 1992 |
