Results 1  10
of
998
The Spatial Semantic Hierarchy
 Artificial Intelligence
, 2000
"... The Spatial Semantic Hierarchy is a model of knowledge of largescale space consisting of multiple interacting representations, both qualitative and quantitative. The SSH is inspired by the properties of the human cognitive map, and is intended to serve both as a model of the human cognitive map and ..."
Abstract

Cited by 339 (35 self)
 Add to MetaCart
The Spatial Semantic Hierarchy is a model of knowledge of largescale space consisting of multiple interacting representations, both qualitative and quantitative. The SSH is inspired by the properties of the human cognitive map, and is intended to serve both as a model of the human cognitive map
Latent Semantic Models for Collaborative filtering
 ACM Trans. Information Systems
"... Collaborative filtering aims at learning predictive models of user preferences, interests or behavior from community data, that is, a database of available user preferences. In this article, we describe a new family of modelbased algorithms designed for this task. These algorithms rely on a statist ..."
Abstract

Cited by 331 (1 self)
 Add to MetaCart
statistical modelling technique that introduces latent class variables in a mixture model setting to discover user communities and prototypical interest profiles. We investigate several variations to deal with discrete and continuous response variables as well as with different objective functions. The main
A generic process algebra
 Proc. of the Workshop Essays on Algebraic Process Calculi (APC 25), volume 162 of Electr. Notes Theor. Comput. Sci
, 2006
"... Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process algebra ..."
Abstract

Cited by 253 (22 self)
 Add to MetaCart
Process algebra is the study of distributed or parallel systems by algebraic means. Originating in computer science, process algebra has been extended in recent years to encompass not just discreteevent systems, but also continuously evolving phenomena, resulting in socalled hybrid process
A powerdomain construction
 SIAM J. OF COMPUTING
, 1976
"... We develop a powerdomain construction, [.], which is analogous to the powerset construction and also fits in with the usual sum, product and exponentiation constructions on domains. The desire for such a construction arises when considering programming languages with nondeterministic features or p ..."
Abstract

Cited by 234 (15 self)
 Add to MetaCart
or parallel features treated in a nondeterministic way. We hope to achieve a natural, fully abstract semantics in which such equivalences as (pparq)=(qparp) hold. The domain (D Truthvalues) is not the right one, and instead we take the (finitely) generable subsets of D. When D is discrete they are ordered
Logics and Models of Real Time: A Survey
"... We survey logicbased and automatabased languages and techniques for the specification and verification of realtime systems. In particular, we discuss three syntactic extensions of temporal logic: timebounded operators, freeze quantification, and time variables. We also discuss the extension of ..."
Abstract

Cited by 221 (15 self)
 Add to MetaCart
of finitestate machines with clocks and the extension of transition systems with time bounds on the transitions. All of the resulting notations can be interpreted over a variety of different models of time and computation, including linear and branching time, interleaving and true concurrency, discrete
Continuous Verification by Discrete Reasoning
, 1994
"... Two semantics are commonly used for the behavior of realtime and hybrid systems: a discrete semantics, in which the temporal evolution is represented as a sequence of snapshots describing the state of the system at certain times, and a continuous semantics, in which the temporal evolution is repres ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Two semantics are commonly used for the behavior of realtime and hybrid systems: a discrete semantics, in which the temporal evolution is represented as a sequence of snapshots describing the state of the system at certain times, and a continuous semantics, in which the temporal evolution
Verification in Continuous Time by Discrete Reasoning
 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology AMAST'95, Lecture Notes in Computer Science 936
, 1995
"... This paper shows how the advantages of both semantics can be combined by adapting the simple verification rules of the discrete semantics to the continuous one. Specifically, we show that if a temporal logic formula has the property of ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
This paper shows how the advantages of both semantics can be combined by adapting the simple verification rules of the discrete semantics to the continuous one. Specifically, we show that if a temporal logic formula has the property of
Symbolic Controller Synthesis for Discrete and Timed Systems
 Hybrid Systems II, LNCS 999
, 1995
"... . This paper presents algorithms for the symbolic synthesis of discrete and realtime controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timedautomata. The algorithms for finding such strategies need, this way o ..."
Abstract

Cited by 133 (16 self)
 Add to MetaCart
. This paper presents algorithms for the symbolic synthesis of discrete and realtime controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timedautomata. The algorithms for finding such strategies need, this way
A Congruence Theorem for Structured Operational Semantics With Predicates
, 1993
"... . We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples t ..."
Abstract

Cited by 130 (5 self)
 Add to MetaCart
. We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples
Exploiting latent semantic information in statistical language modeling
 Proc. IEEE. 88
, 2000
"... Statistical language models used in largevocabulary speech recognition must properly encapsulate the various constraints, both local and global, present in the language. While local constraints are readily captured through ngram modeling, global constraints, such as longterm semantic dependencies ..."
Abstract

Cited by 114 (7 self)
 Add to MetaCart
dependencies, have been more difficult to handle within a datadriven formalism. This paper focuses on the use of latent semantic analysis, a paradigm that automatically uncovers the salient semantic relationships between words and documents in a given corpus. In this approach, (discrete) words and documents
Results 1  10
of
998