Sciweavers

15792 search results - page 2824 / 3159
» Computational Abstraction Steps
Sort
View
DLOG
2006
15 years 8 months ago
Model checking the basic modalities of CTL with Description Logic
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...
DLT
2006
15 years 8 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
DMIN
2006
114views Data Mining» more  DMIN 2006»
15 years 8 months ago
Towards Using Fewer Features for Text Classification
Abstract-- Text classification or categorization is a conventional classification problem applied to the text domain. In the cases when statistical classification methods are used,...
Yuan Yuan, Tianyang Gu
FLAIRS
2004
15 years 8 months ago
Splitting Ratios: Metric Details of Topological Line-Line Relations
Within the geographic domain, an important class of relies on geometric abstractions in the form of lines where, for instance, transportation networks and trajectories of movement...
Konstantinos A. Nedas, Max J. Egenhofer
ERSA
2006
161views Hardware» more  ERSA 2006»
15 years 8 months ago
A Parametric Study of Scalable Interconnects on FPGAs
Abstract-- With the constantly increasing gate capacity of FPGAs, a single FPGA chip is able to employ large-scale applications. To connect a large number of computational nodes, N...
Daihan Wang, Hiroki Matsutani, Masato Yoshimi, Mic...
« Prev « First page 2824 / 3159 Last » Next »