|
|
Creator | Title | Description | Subject | Date |
126 |
|
Fuchs, Henry | The automatic sensing and analysis of 3-D surface points from visual scenes | Described are the design and implementation of a new range-measuring sensing device and an associated software algorithm for constructing surface descriptions of arbitrary three-dimensional objects from single or multiple views. The sensing device, which measures surface points from objects in its ... | Range-measuring; Sensing device | 1976 |
127 |
|
Riloff, Ellen M. | Automatically constructing a dictionary for information extraction tasks | Knowledge-based natural language processing systems have achieved good success with certain tasks but they are often criticized because they depend on a domain-specific dictionary that requires a great deal of manual knowledge engineering. This knowledge engineering bottleneck makes knowledge-based ... | Information extraction; Dictionary construction; Knowledge-based systems; AutoSlog; Domain-specific dictionary | 1993 |
128 |
|
Freire, Juliana | Automatically extracting form labels | We describe a machine-learning-based approach for extracting attribute labels from Web form interfaces. Having these labels is a requirement for several techniques that attempt to retrieve and integrate data that reside in online databases and that are hidden behind form interfaces, including schema... | Learning classifiers | 2008 |
129 |
|
Riloff, Ellen M. | Automatically generating extraction patterns from untagged text | Many corpus-based natural language processing systems rely on text corpora that have been manually annotated with syntactic or semantic tags. In particular, all previous dictionary construction systems for information extraction have used an annotated training corpus or some form of annotated input... | Information extraction; Automatically generating; Extraction patterns; Untagged text; Corpus-based; AutoSlog-TS; AutoSlog system; MUC-4; Dictionary construction | 1996 |
130 |
|
Davis, Al | Automating the design of embedded domain specific accelerators | Domain specific architecture (DSA) design currently involves a lengthy process that requires significant designer knowledge, experience, and time in arriving at a suitable code generator and architecture for the target application suite. Given the stringent time to market constraints and the dyna... | Domain specific architecture; Stall cycle analysis; SCA; Domain specific accelerators | 2008 |
131 |
|
Sobh, Tarek M. | Autonomous Observation | We address the problem of observing an agent. We advocate a modeling approach for the visual system and its observer, where a discrete event dynamic system (DEDS) framework is developed and "events" are defined as ranges on parameter subsets. The dynamic recursive context for finite state machines (... | Observation; Manipulation process | 1992 |
132 |
|
Sobh, Tarek M. | Autonomous observation | We address the problem of observing an agent?? We advocate a modeling approach for the visual system and its observer where a discrete event dynamic system DEDS framework is developed and events are de ned as ranges on parameter subsets?? The dynamic recursive context for nite state machine... | Autonomous observation | 1992 |
133 |
|
Carter, John B. | The avalanche myrinet simulation package | This is a user manual for version 2.0 of the Myrinet simulation package. Users of the V2.0 package can specify arbitrary network topologies composed of Myrinet switches with different number of ports. For example, 4-port and 32-port switches can be used in a single system. Because the V2.0 model sup... | Avalanche Myrinet; Simulation Package; User manual; Myrinet switches; port switches | 1996 |
134 |
|
Carter, John B. | The avalanche myrinet simulation package user manual for V2.0 | This is a user manual for Version 2.0 of the Myrinet simulation package Users of the V2.0 pack age can specify arbitrary network topologies composed of Myrinet switches with different number of ports For example port and 4-port switches can be used in a single system Because the V2.0 model suppor... | Avalanche Myrinet; Simulation Package; user manual; Myrinet switches; Port switches | 1996 |
135 |
|
Carter, John B.; Davis, Al; Kuramkote, Ravindra; Stoller, Leigh B. | Avalanche: A communication and memory architecture for scalable parallel computing | As the gap between processor and memory speeds widens?? system designers will inevitably incorpo rate increasingly deep memory hierarchies to maintain the balance between processor and memory system performance At the same time?? most communication subsystems are permitted access only to main m... | Avalanche; Communication architecture; Memory architecture | 1995 |
136 |
|
Carter, John B. | Avalanche: A communication and memory architecture for scalable parallel computing | As the gap between processor and memory speeds widens, system designers will inevitably incorporate increasingly deep memory hierarchies to maintain the balance between processor and memory system performance. At the same time, most communication subsystems are permitted access only to main memory ... | Avalanche; Computer memory; Memory architecture | 1995 |
137 |
|
Stark, Michael M.; Martin, William; Cohen, Elaine; Lyche, Tom; Riesenfeld, Richard F. | B-splines for physically-based rendering | Although B-spline curves and surfaces have enjoyed a long established place in the graphics community as constructive modeling tools, the use of B-spline approximation techniques has received relatively little attention in rendering. In this work we explore the use of 4D and 5D tensor product B-s... | B-spline curves; Rendering algorithms | 2002-01-09 |
138 |
|
Lindstrom, Gary E. | Backtracking in generalized control settings | Backtracking is a powerful conceptual and practical technique in programming. However, its application in general has been limited to global control over recursive programs. In this paper we explore through several examples the coherence and utility of applying backtracking in more general control s... | Backtracking | 1977 |
139 |
|
Freire, Juliana | Beyond depth-first strategies: improving tabled logic programs through alternative scheduling | Tabled evaluation ensures termination for programs with finite models by keeping track of which subgoals have been called. Given several variant subgoals in an evaluation, only the fi rst one encountered will use program-clause resolution; the rest will resolve with the answers generated by the f... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1998 |
140 |
|
Freire, Juliana | Beyond depth-first: improving tabled logic programs through alternative scheduling strategies | Tabled evaluations ensure termination of logic programs with fi nite models by keeping track of which subgoals have been called Given several variant subgoals in an evaluation, only the fi rst one encountered will use program clause resolution the rest uses answer resolution This use of answer r... | Alternate scheduling; SLG-WAM; Tabled logic programs | 1996 |
141 |
|
Hansen, Charles D. | Binary-swap and shear-warp volume renderer on the T3D | Large parallel machines give today's scientists the ability to compute very large simulations which may generate equally large data. Not only does having visualization tools on the parallel system allow the scientist to take advantage of the large memory to visualize the data, the processing power a... | Volume rendering; Binary-swap | 1995 |
142 |
|
Hansen, Charles D. | Binary-swap volumetric rendering on the T3D | This paper presents a data distributed parallel raytraced volume rendering algorithm and its implementation on the CRI T3D. This algorithm distributes the data and the computational load to individual processing units to achieve fast and high-quality rendering of high-resolution data. The volume dat... | Volume rendering; Binary-swap; Ray tracing; Parallel rendering | 1995 |
143 |
|
Johnson, Christopher R. | Biomedical visual computing: case studies and challenges | Advances in computational geometric modeling, imaging, and simulation let researchers build and test models of increasing complexity, generating unprecedented amounts of data. As recent research in biomedical applications illustrates, visualization will be critical in making this vast amount of data... | | 2012-01-01 |
144 |
|
Gerpheide, George E. | Bit-driven logic: a style of digital logic for VLSI design | This memo describes a new style of low-level digital logic design called Bit-Driven Logic (BDL) which may prove attractive for the design of VLSI chips. BDL is an application of speed-independent, data-flow ideas to a very low level. It has the advantages of good locality, clockless operation, and... | Bit-Driven Logic; BDL; Digital logic design; VLSI chips | 1980 |
145 |
|
Riloff, Ellen M. | Bootstrapping for text learning tasks | When applying text learning algorithms to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. This paper presents bootstrapping as an alternative approach to learning from large sets of labeled data. Instead of a large quantity ... | Bootstrapping; Text learning algorithms; Seed information | 1999 |
146 |
|
Riloff, Ellen M. | Bootstrapping method for learning semantic lexicons using extraction pattern contexts | This paper describes a bootstrapping algorithm called Basilisk that learns high-quality semantic lexicons for multiple categories. Basilisk begins with an unannotated corpus and seed words for each semantic category, which are then bootstrapped to learn new words for each category. Basilisk hypothe... | Basilisk; Bootstrapping method; Semantic lexicons | 2002 |
147 |
|
Hansen, Charles D. | Boundary aware reconstruction of scalar fields | In visualization, the combined role of data reconstruction and its classification plays a crucial role. In this paper we propose a novel approach that improves classification of different materials and their boundaries by combining information from the classifiers at the reconstruction stage. Our ap... | | 2014-01-01 |
148 |
|
Gopalakrishnan, Ganesh | Bounded transaction model checking | Industrial cache coherence protocol models often have too many reachable states, preventing full reachability analysis even for small model instances (number of processors, addresses, etc.). Several partial search debugging methods are, therefore, employed, including lossy state compression using... | Model checking; Reachability analysis | 2006-02-27 |
149 |
|
Freire, Juliana | Bridging the XML-relational divide with LegoDB: a demonstration | We present LegoDB, a cost-based XML storage mapping engine that automatically explores a space of possible XML-to-relational mappings and selects an efficient mapping for a given application. | LegoDB; Storage mappings | 2003 |
150 |
|
Brandt, Richard C. | Building databases for the computer-based memorization system | The Computer-Based Memorization System (CBMS) consists of eight games used by students to memorize groups of related facts that are stored in an associative network. The instructional design is built into the games. Designing and implementing associative networks for the CBMS is very different from... | Computer-Based Memorization System; CBMS | 1988 |