Results 1 - 10 of 2,595

Maintaining knowledge about temporal intervals

by James F. Allen - COMMUNICATION OF ACM , 1983
"... The problem of representing temporal knowledge arises in many areas of computer science. In applications in which such knowledge is imprecise or relative, current representations based on date lines or time instants are inadequate. An interval-based temporal logic is introduced, together WiUl a comp ..."
Abstract - Cited by 2942 (13 self) - Add to MetaCart
computationally effective reasoning algorithm based on constraint- propagation. This system is notable in offering a delicate balance between expressive power and the efficiency of its deductive engine. A notion of reference intervals is introduced which captures the temporal hierarchy implicit in many domains

Alternating-time Temporal Logic

by Rajeev Alur, Thomas Henzinger, Orna Kupferman - Journal of the ACM , 1997
"... Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract - Cited by 620 (53 self) - Add to MetaCart
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general

Web Caching and Zipf-like Distributions: Evidence and Implications

by Lee Breslau, Pei Cao, Li Fan, Graham Phillips, Scott Shenker - IN INFOCOM , 1999
"... This paper addresses two unresolved issues about web caching. The first issue is whether web requests from a fixed user community are distributed according to Zipf's law [22]. Several early studies have supported this claim [9], [5], while other recent studies have suggested otherwise [16], [2] ..."
Abstract - Cited by 1091 (2 self) - Add to MetaCart
]. The ;econd issue relates to a number of recent studies on the characteristics of web proxy traces, which have shown that the hit-ratios and temporal locality of the traces exhibit certain asymptotic properties that are uniform across the different sets of the traces [43, [XO], [71, [XO], [XS]. In partlc

Finding structure in time

by Jeffrey L. Elman - COGNITIVE SCIENCE , 1990
"... Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a pro ..."
Abstract - Cited by 2071 (23 self) - Add to MetaCart
Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a

MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS

by Yehuda Koren, Robert Bell, Chris Volinsky - IEEE COMPUTER , 2009
"... As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern co ..."
Abstract - Cited by 593 (4 self) - Add to MetaCart
As the Netflix Prize competition has demonstrated, matrix factorization models are superior to classic nearest-neighbor techniques for producing product recommendations, allowing the incorporation of additional information such as implicit feedback, temporal effects, and confidence levels. Modern

View from the top: hierarchies and reverse hierarchies in the visual system

by Shaul Hochstein, Merav Ahissar - NEURON , 2002
"... We propose that explicit vision advances in reverse hierarchical direction, as shown for perceptual learn-ing. Processing along the feedforward hierarchy of areas, leading to increasingly complex represen-tations, is automatic and implicit, while conscious perception begins at the hierarchy’s top, g ..."
Abstract - Cited by 233 (4 self) - Add to MetaCart
We propose that explicit vision advances in reverse hierarchical direction, as shown for perceptual learn-ing. Processing along the feedforward hierarchy of areas, leading to increasingly complex represen-tations, is automatic and implicit, while conscious perception begins at the hierarchy’s top

Development and neurophysiology of mentalizing

by Uta Frith, Christopher D. Frith - Philosophical Transactions of the Royal Society of London. Series B: Biological Sciences , 2003
"... The mentalizing (theory of mind) system of the brain is probably in operation from ca. 18 months of age, allowing implicit attribution of intentions and other mental states. Between the ages of 4 and 6 years explicit mentalizing becomes possible, and from this age children are able to explain the mi ..."
Abstract - Cited by 296 (13 self) - Add to MetaCart
the misleading reasons that have given rise to a false belief. Neuroimaging studies of mentalizing have so far only been carried out in adults. They reveal a system with three components consistently activated during both implicit and explicit mentalizing tasks: medial prefrontal cortex (MPFC), temporal poles

View-dependent simplification of arbitrary polygonal environments

by David Luebke, Carl Erikson , 1997
"... Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the user’s viewing position shifts, and adaptively, processing the entire database without first decomposing ..."
Abstract - Cited by 286 (15 self) - Add to MetaCart
viewdependent simplification. Briefly, HDS works by clustering vertices together in a hierarchical fashion. The simplification process continuously queries this hierarchy to generate a scene containing only those polygons that are important from the current viewpoint. When the volume of space associated with a

Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data

by Danny Holten - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS , 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edge ..."
Abstract - Cited by 271 (12 self) - Add to MetaCart
A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non

Smooth View-Dependent Level-of-Detail Control and Its Application to Terrain Rendering

by Hugues Hoppe
"... The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of view-dependent level-of-detail control. Among these, the viewdependent progressive mesh (VDPM) framewor ..."
Abstract - Cited by 264 (1 self) - Add to MetaCart
) framework represents an arbitrary triangle mesh as a hierarchy of geometrically optimized refinement transformations, from which accurate approximating meshes can be efficiently retrieved. In this paper we extend the general VDPM framework to provide temporal coherence through the runtime creation
Results 1 - 10 of 2,595