|
|
Creator | Title | Description | Subject | Date |
| 651 |
 |
Brunvand, Erik L. | Peephole optimization of asynchronous macromodule networks | Abstract- Most high-level synthesis tools for asynchronous circuits take descriptions in concurrent hardware description languages and generate networks of macromodules or handshake components. In this paper, we propose a peephole optimizer for these networks. Our peephole optimizer first deduces an... | | 1999 |
| 652 |
 |
Gopalakrishnan, Ganesh | Peephole optimization of asynchronous networks through process composition and burst-mode machine generation | In this paper we discuss the problem of improving the e ciency of macromodule networks generated through asynchronous high level synthesis We compose the behaviors of the modules in the sub network being optimized using Dill s trace theoretic operators to get a single behavioral description for ... | Macromodule networks; Peephole; Asynchronous networks | 1993 |
| 653 |
 |
Gopalakrishnan, Ganesh | Peephole optimization of asynchronous networks through process composition and burst-mode machine generation | In this paper, we discuss the problem of improving the efficiency of macromodule networks generated through asynchronous high level synthesis. We compose the behaviors of the modules in the sub-network being optimized using Dill's trace-theoretic operators to get a single behavioral description for ... | Peephole optimization; Macromodule networks; Process composition; Burst-mode | 1993 |
| 654 |
 |
Wyman, Chris; Hansen, Charles D. | Penumbra maps | Generating soft shadows quickly is difficult. Few techniques have enough flexibility to interactively render soft shadows in scenes with arbitrarily complex occluders and receivers. This paper introduces the penumbra map, which extends current shadow map techniques to interactively approximate so... | Penumbra maps; Soft shadows; Shadow maps | 2003-04-23 |
| 655 |
 |
Hansen, Charles D. | Penumbra maps: approximate soft shadows in real-time | Generating soft shadows quickly is difficult. Few techniques have enough flexibility to interactively render soft shadows in scenes with arbitrarily complex occluders and receivers. This paper introduces the penumbra map, which extends current shadow map techniques to interactively approximate soft ... | | 2003-01-01 |
| 656 |
 |
Creem-Regehr, Sarah Hope; Gooch, Amy A.; Sahm, Cynthia S.; Thompson, William B. | Perceiving virtual geographic slant: action influences perception | Four experiments varied the extent and nature of observer movement in a virtual environment to examine the influence of action on estimates of geographical slant. Previous slant studies demonstrated that people consciously overestimate hill slant but can still accurately guide an action toward th... | Geographical slant; Virtual environment | 2003-06-16 |
| 657 |
 |
Gooch, Bruce; Reinhard, Erik | Perception-driven black-and-white drawings and caricatures | In this paper, we present a method for automatically creating black-and-white drawings of human faces from photographs. We then demonstrate new techniques for deforming these drawings to create caricatures intended to highlight and exaggerate facial features. A number of psychophysical studies we... | Caricatures; Human faces | 2002-01-22 |
| 658 |
 |
Brunvand, Erik L. | Performance analysis and optimization of asynchronous circuits | Asynchronous/Self-timed circuits are beginning to attract renewed attention as promising means of dealing with the complexity of modern VZSI designs. Very few analysis techniques or tools are available for estimating their performance. In this paper we adapt the theory of Generalized Timed Petri-n... | | 1994 |
| 659 |
 |
Gopalakrishnan, Ganesh | Performance analysis and optimization of asynchronous circuits | Asynchronous/Self-timed circuits are beginning to attract renewed attention as promising means of dealing with the complexity of modern VLSI designs. However, there are very few analysis techniques or tools available for estimating the performance of asynchronous circuits. In this paper we adapt th... | Asynchronous circuits; Performance analysis; Optimization; VLSI circuits | 1994 |
| 660 |
 |
Fujimoto, Richard M. | Performance measurements of distributed simulation strategies | A multiprocessor-based, distributed simulation testbed is described that facilitates controlled experimentation with distributed simulation algorithms. The performance of simulation strategies using deadlock avoidance and deadlock detection and recovery techniques are examined using various syntheti... | Performance; Distributed simulation; Discrete simulation; Event-oriented; Queueing models | 1987 |
| 661 |
 |
Henderson, Thomas C. | Performance of arc consistency algorithms on the CRAY | The consistent labeling problem arises in high level computer vision when assigning semantic meaning to the regions of a n image. One of the drawbacks of this method is that it is rather slow. By using the consistency tests, node, arc and path consistency [9], the search space is drastically reduced... | Arc consistency algorithms; CRAY supercomputer; Consistent labeling problem | 1987 |
| 662 |
 |
Gopalakrishnan, Ganesh | Performance studies of PV: an On-the-fly model-checker for LTL-X featuring selective caching and partial order reduction | We present an enumerative model-checker PV that uses a new partial order reduction algorithm called Twophase. This algorithm does not use the in-stack check to implement the proviso, making the combination of Twophase with on-the-fly LTL-X model-checking based on nested depth-first search, as well a... | Model-checker; PV; Performance; On-the-fly; Partial order reduction algorithm;' Twophase | 2001 |
| 663 |
 |
Kessler, Robert R. | Persistence is hard, then you die! or compiler and runtime support for a persistent common Lisp. | Integrating persistence into an existing programming language is a serious undertaking. Preserving the essence of t h e existing language, adequately supporting persistence, and maintaining efficiency require low-level support from the compiler and runtime systems. Pervasive, low-level changes were ... | Persistence; Programming language; Lisp compiler; Persistent Lisp | 1994 |
| 664 |
 |
Freire, Juliana | Personalizing the web using site descriptions | The information overload on the Web has created a great need for efficient filtering mechanisms. Many sites (e.g., CNN and Quicken) address this problem by allowing a user to create personalized pages that contain only information that is of interest to the user. We propose a new approach for p... | XPointer; Data extraction; Site descriptions; Personalized web pages | 1999 |
| 665 |
 |
Regehr, John | Ph.D. Proposal: hierarchical loadable schedulers | The processors in workstations, personal computers, and servers are becoming increasingly powerful, enabling them to run new kinds of applications, and to simultaneously run combinations of applications that were previously infeasible. However, fast hardware is not enough-the operating system must e... | | 1999-01-01 |
| 666 |
 |
Reinhard, Erik; Stark, Michael M.; Shirley, Peter S. | Photographic tone reproduction for digital images | A classic photographic task is the mapping of the potentially high dynamic range of real world luminances to the low dynamic range of the photographic print. This tone reproduction problem is also faced by computer graphics practitioners who must map digital images to a low dynamic range print or... | Tone reproduction operator; Photographic tone | 2002-01-14 |
| 667 |
 |
Hansen, Charles D. | Physically-based interactive schlieren flow visualization | Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis has employed techniques such as shadowgraph and schlieren imaging for centuries which allow empirical observation of inho... | | 2010-03 |
| 668 |
 |
Flatt, Matthew | PLT scheme as an intermediate language | | | 2010-02-26 |
| 669 |
 |
Regehr, John | Pluggable abstract domains for analyzing embedded software | Many abstract value domains such as intervals, bitwise, constants, and value-sets have been developed to support dataflow analysis. Different domains offer alternative tradeoffs between analysis speed and precision. Furthermore, some domains are a better match for certain kinds of code than others. ... | | 2006-01-01 |
| 670 |
 |
Atashroo, Mohammad Ali | Pole-Zero modeling and its applications to speech processing | Autocorrelation Pole-Zero modeling identifies the parameters of a rational transfer function H(z) whose short time-lag autocorrelations either exactly match (Autocorrelation partial Realization) or closely approximate (Autocorrelation Prediction) those of a given spectrum. As a result, the spectrum... | Pole-Zero modeling; Speech processing | 1976 |
| 671 |
 |
Regehr, John | Poster abstract: TinyOS 2.1 adding threads and memory protection to tinyOS | The release of TinyOS 2.0 two years ago was motivated by the need for greater platform flexibility, improved robustness and reliability, and a move towards service oriented application development. Since this time, we have seen the community embrace these efforts and add support for additional hardw... | | 2008-01-01 |
| 672 |
 |
Balasubramonian, Rajeev | Power efficient approaches to redundant multithreading | Noise and radiation-induced soft errors (transient faults) in computer systems have increased significantly over the last few years and are expected to increase even more as we move toward smaller transistor sizes and lower supply voltages. Fault detection and recovery can be achieved through redund... | Reliability; Power; Transient faults; Soft errors; Redundant multithreading (RMT); Heterogeneous chip multiprocessors dynamic frequency scaling | 2007-08 |
| 673 |
 |
Balasubramonian, Rajeev | Power efficient resource scaling in partitioned architectures through dynamic heterogeneity | The ever increasing demand for high clock speeds and the desire to exploit abundant transistor budgets have resulted in alarming increases in processor power dissipation. Partitioned (or clustered) architectures have been proposed in recent years to address scalability concerns in future billion-tr... | Partitioned architectures; Clustered architectures; Energy × Delay2, Temperature; Dynamic frequency scaling; Thermal emergency | 2006 |
| 674 |
 |
Venkatasubramanian, Suresh | Power to the points: validating data memberships in clusterings | In this paper, we present a method to attach affinity scores to the implicit labels of individual points in a clustering. The affinity scores capture the confidence level of the cluster that claims to "own" the point. We demonstrate that these scores accurately capture the quality of the label assig... | | 2013-01-01 |
| 675 |
 |
Balasubramonian, Rajeev | Power-efficient approaches to reliability | Radiation-induced soft errors (transient faults) in computer systems have increased significantly over the last few years and are expected to increase even more as we move towards smaller transistor sizes and lower supply voltages. Fault detection and recovery can be achieved through redundancy. St... | Radiation-induced; Soft errors; Transient faults; Redundant thread; Trailing thread; Power consumption | 2005 |
