Sciweavers

1404 search results - page 181 / 281
» Complexity of admissible rules
Sort
View
ICDIM
2010
IEEE
13 years 6 months ago
Visualizing e-Government portal and its performance in WEBVS
An e-Government portal is responsible to provide news, information and services to citizens, merchants and tourists in a reliable way. Previously, we proposed a Web Monitoring Sys...
Ho Si Meng, Simon Fong
PAAMS
2010
Springer
13 years 6 months ago
A Case Study on Grammatical-Based Representation for Regular Expression Evolution
Abstract. Regular expressions, or simply regex, have been widely used as a powerful pattern matching and text extractor tool through decades. Although they provide a powerful and f...
Antonio González-Pardo, David F. Barrero, D...
ICC
2009
IEEE
13 years 6 months ago
Performance Evaluation of QAM-Based BICM: An Analytical Approach
We present an analytical approach to determine the performance of bit-interleaved coded modulation (BICM) transmission over unfaded Gaussian channels. In particular, we derive expr...
Alireza Kenarsari-Anhari, Lutz H.-J. Lampe
ICMCS
2009
IEEE
149views Multimedia» more  ICMCS 2009»
13 years 6 months ago
A multi-agent framework for a hybrid dialog management system
The importance of dialog management systems has increased in recent years. Dialog systems are created for domain specific applications, so that a high demand for a flexible dialog...
Stefan Schwärzler, Joachim Schenk, Günth...
CCR
2010
151views more  CCR 2010»
13 years 6 months ago
iNFAnt: NFA pattern matching on GPGPU devices
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
Niccolo Cascarano, Pierluigi Rolando, Fulvio Risso...