Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
38,542
Computing semantic relatedness using Wikipedia-based explicit semantic analysis
- In Proceedings of the 20th International Joint Conference on Artificial Intelligence
, 2007
"... Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from Wikipedi ..."
Abstract
-
Cited by 562 (9 self)
- Add to MetaCart
Computing semantic relatedness of natural language texts requires access to vast amounts of common-sense and domain-specific world knowledge. We propose Explicit Semantic Analysis (ESA), a novel method that represents the meaning of texts in a high-dimensional space of concepts derived from
An explicit model for ADvance
"... ADvance is a powerful round-trip UML viewer integrated with the VisualWorks Smalltalk environment. Because ADvance implicitly uses Smalltalk as its model, it cannot be used for anything but Smalltalk code that is loaded in the image. This project removes this restriction by transparently introducin ..."
Abstract
- Add to MetaCart
introducing an explicit model for ADvance using Smalltalk's meta-programming facilities. This solution is validated by showing how it can be used to display ADvance diagrams on Moose models.
BEEM: Benchmarks for explicit model checkers
- In Proc. of SPIN Workshop, volume 4595 of LNCS
, 2007
"... Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their correctness properties (both safety and liveness). The benchmark set is accompanied by an comprehensive web portal, which prov ..."
Abstract
-
Cited by 62 (5 self)
- Add to MetaCart
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their correctness properties (both safety and liveness). The benchmark set is accompanied by an comprehensive web portal, which
Comparing Symbolic and Explicit Model
"... Abstract. There are two main paradigms for model checking: symbolic model checking, as is performed by the tool RuleBase, and explicit state model checking, as is performed by Spin. It is often accepted that the former is better for verifying hardware systems, while the latter has advantages for ver ..."
Abstract
- Add to MetaCart
Abstract. There are two main paradigms for model checking: symbolic model checking, as is performed by the tool RuleBase, and explicit state model checking, as is performed by Spin. It is often accepted that the former is better for verifying hardware systems, while the latter has advantages
Approximate Explicit Model Predictive
- Proc. of IEEE International Symposium on Computer Aided Control System Design
, 2002
"... Solutions to constrained linear model predictive control (MPC) problems can be pre-computed o#-line in an explicit form as a piecewise linear (PWL) state feedback defined on a polyhedral partitioning of the state space. Even though real-time optimization is avoided, implementation of the PWL stat ..."
Abstract
- Add to MetaCart
Solutions to constrained linear model predictive control (MPC) problems can be pre-computed o#-line in an explicit form as a piecewise linear (PWL) state feedback defined on a polyhedral partitioning of the state space. Even though real-time optimization is avoided, implementation of the PWL
Explicit models for perverse sheaves
, 2002
"... We consider categories of generalized perverse sheaves, with relaxed constructibility conditions, by means of the process of gluing t-structures and we exhibit explicit abelian categories defined in terms of standard sheaves categories which are equivalent to the former ones. In particular, we are a ..."
Abstract
- Add to MetaCart
We consider categories of generalized perverse sheaves, with relaxed constructibility conditions, by means of the process of gluing t-structures and we exhibit explicit abelian categories defined in terms of standard sheaves categories which are equivalent to the former ones. In particular, we
Explicit Modeling Of Phonological Changes
, 2002
"... This article describes the operation and the experimental evaluation of the pronunciation modeling component of the first Hungarian large vocabulary continuous speech recognition system. The proposed method is based on the implementation of context dependent rewrite rules by weighted finite state tr ..."
Abstract
- Add to MetaCart
This article describes the operation and the experimental evaluation of the pronunciation modeling component of the first Hungarian large vocabulary continuous speech recognition system. The proposed method is based on the implementation of context dependent rewrite rules by weighted finite state
Modeling and Forecasting Realized Volatility
, 2002
"... this paper is built. First, although raw returns are clearly leptokurtic, returns standardized by realized volatilities are approximately Gaussian. Second, although the distributions of realized volatilities are clearly right-skewed, the distributions of the logarithms of realized volatilities are a ..."
Abstract
-
Cited by 549 (50 self)
- Add to MetaCart
: a fractionally-integrated Gaussian vector autoregression (VAR) . Importantly, our approach explicitly permits measurement errors in the realized volatilities. Comparing the resulting volatility forecasts to those obtained from currently popular daily volatility models and more complicated high
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract
-
Cited by 758 (41 self)
- Add to MetaCart
Many different methods have been devised for automatically verifying finite state systems by examining state-graph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number
Results 1 - 10
of
38,542
