Sciweavers

3652 search results - page 216 / 731
» A study of query length
Sort
View
SPIRE
2010
Springer
13 years 6 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
INFOCOM
2010
IEEE
13 years 5 months ago
Optimal Control of Wireless Networks with Finite Buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achie...
Long Bao Le, Eytan Modiano, Ness B. Shroff
CORR
2011
Springer
217views Education» more  CORR 2011»
13 years 3 months ago
Boolean Networks Design by Genetic Algorithms
Abstract. We present and discuss the results of an experimental analysis in the design of Boolean networks by means of genetic algorithms. A population of networks is evolved with ...
Andrea Roli, Cristian Arcaroli, Marco Lazzarini, S...
SDM
2012
SIAM
289views Data Mining» more  SDM 2012»
11 years 10 months ago
Mining Compressing Sequential Patterns
Compression based pattern mining has been successfully applied to many data mining tasks. We propose an approach based on the minimum description length principle to extract seque...
Hoang Thanh Lam, Fabian Moerchen, Dmitriy Fradkin,...
WEBI
2009
Springer
14 years 2 months ago
Full-Subtopic Retrieval with Keyphrase-Based Search Results Clustering
We consider the problem of retrieving multiple documents relevant to the single subtopics of a given web query, termed “full-subtopic retrieval”. To solve this problem we pres...
Andrea Bernardini, Claudio Carpineto, Massimiliano...