Results 1 - 10 of 29,842

Automatic Computation of . . .

by Cai-nicolas Ziegler, Kai Simon, Georg Lausen , 2006
"... Taxonomic measures of semantic proximity allow us to compute the relatedness of two concepts. These metrics are versatile instruments required for diverse applications, e.g., the Semantic Web, linguistics, and also text mining. However, most approaches are only geared towards hand-crafted taxonomic ..."
Abstract - Add to MetaCart
Taxonomic measures of semantic proximity allow us to compute the relatedness of two concepts. These metrics are versatile instruments required for diverse applications, e.g., the Semantic Web, linguistics, and also text mining. However, most approaches are only geared towards hand-crafted taxonomic

Automatically characterizing large scale program behavior

by Timothy Sherwood, Erez Perelman, Greg Hamerly , 2002
"... Understanding program behavior is at the foundation of computer architecture and program optimization. Many pro-grams have wildly different behavior on even the very largest of scales (over the complete execution of the program). This realization has ramifications for many architectural and com-pile ..."
Abstract - Cited by 778 (41 self) - Add to MetaCart
of algorithms based on clustering capable of an-alyzing this behavior. We then demonstrate an application of this technology to automatically determine where to simulate for a program to help guide computer architecture research. 1.

On the control of automatic processes: A parallel distributed processing account of the Stroop effect

by Jonathan D. Cohen, James L. Mcclelland, Kevin Dunbar - Psychological Review , 1990
"... Traditional views of automaticity are in need of revision. For example, automaticity otten has been treated as an all-or-none phenomenon, and traditional ~es have held that automatic processes are independent of attention. Yet recent empirical data suggest that automatic processes are continu-ous, a ..."
Abstract - Cited by 511 (45 self) - Add to MetaCart
. With the Stroop effect as an example, automatic processes are shown to be continuous and to emerge gradually with practice. Specifically, a computational model of the Stroop task simulates the time course of processing as well as the effects of learning. This was accomplished by combining the cascade mechanism

Context-Aware Computing Applications

by Bill Schilit, Norman Adams, Roy Want , 1995
"... This paper describes systems that examine and react to an individual's changing context. Such systems can promote and mediate people's mleractlOns with devices, computers, and other people, and they can help navigate unfamiliar places. We bel1eve that a lunded amount of information coveTIn ..."
Abstract - Cited by 984 (6 self) - Add to MetaCart
selec-tion, automatic contextual reconfiguratlOn, contexlual information and commands, and context-triggered ac-tions. fnstances of these application types ha11e been prototyped on the PARCTAB, a wireless, palm-sl.:ed computer.

The automatic computation for SUSY

by Masato Jimbo, Tadashi Kon , 1995
"... MINAMI-TATEYA collaboration We have constructed a system for the automatic computation of cross-sections for the processes of the SUSY QED by the extension of the GRACE system including a Majorana fermion. The system has also been applied to another model including Majorana fermions, MSSM, by the de ..."
Abstract - Add to MetaCart
MINAMI-TATEYA collaboration We have constructed a system for the automatic computation of cross-sections for the processes of the SUSY QED by the extension of the GRACE system including a Majorana fermion. The system has also been applied to another model including Majorana fermions, MSSM

Photo tourism: Exploring photo collections in 3D

by Noah Snavely, Steven M. Seitz, Richard Szeliski - IN PROC. ACM SIGGRAPH , 2006
"... We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model of th ..."
Abstract - Cited by 677 (37 self) - Add to MetaCart
We present a system for interactively browsing and exploring large unstructured collections of photographs of a scene using a novel 3D interface. Our system consists of an image-based modeling front end that automatically computes the viewpoint of each photograph as well as a sparse 3D model

Fast approximate nearest neighbors with automatic algorithm configuration

by Marius Muja, David G. Lowe - In VISAPP International Conference on Computer Vision Theory and Applications , 2009
"... nearest-neighbors search, randomized kd-trees, hierarchical k-means tree, clustering. For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high-dimensional problems ..."
Abstract - Cited by 455 (2 self) - Add to MetaCart
nearest-neighbors search, randomized kd-trees, hierarchical k-means tree, clustering. For many computer vision problems, the most time consuming component consists of nearest neighbor matching in high-dimensional spaces. There are no known exact algorithms for solving these high

A Morphable Model For The Synthesis Of 3D Faces

by Volker Blanz , Thomas Vetter , 1999
"... In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face i ..."
Abstract - Cited by 1088 (55 self) - Add to MetaCart
In this paper, a new technique for modeling textured 3D faces is introduced. 3D faces can either be generated automatically from one or more photographs, or modeled directly through an intuitive user interface. Users are assisted in two key problems of computer aided face modeling. First, new face

Effective Erasure Codes for Reliable Computer Communication Protocols

by Luigi Rizzo , 1997
"... Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend to b ..."
Abstract - Cited by 470 (14 self) - Add to MetaCart
Reliable communication protocols require that all the intended recipients of a message receive the message intact. Automatic Repeat reQuest (ARQ) techniques are used in unicast protocols, but they do not scale well to multicast protocols with large groups of receivers, since segment losses tend

A Maximum Entropy approach to Natural Language Processing

by Adam L. Berger, Stephen A. Della Pietra , Vincent J. Della Pietra - COMPUTATIONAL LINGUISTICS , 1996
"... The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we des ..."
Abstract - Cited by 1366 (5 self) - Add to MetaCart
The concept of maximum entropy can be traced back along multiple threads to Biblical times. Only recently, however, have computers become powerful enough to permit the widescale application of this concept to real world problems in statistical estimation and pattern recognition. In this paper we
Results 1 - 10 of 29,842