Sciweavers

3270 search results - page 78 / 654
» Approximate String Processing
Sort
View
COLT
1992
Springer
13 years 12 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
ICALP
2007
Springer
13 years 11 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
JSAC
2006
163views more  JSAC 2006»
13 years 7 months ago
Fast and Scalable Pattern Matching for Network Intrusion Detection Systems
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packets....
Sarang Dharmapurikar, John W. Lockwood
JMLR
2010
141views more  JMLR 2010»
13 years 2 months ago
Hierarchical Gaussian Process Regression
We address an approximation method for Gaussian process (GP) regression, where we approximate covariance by a block matrix such that diagonal blocks are calculated exactly while o...
Sunho Park, Seungjin Choi
ICTCS
2001
Springer
14 years 5 days ago
Job Shop Scheduling Problems with Controllable Processing Times
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...