Sciweavers

513 search results - page 97 / 103
» Finitely Based, Finite Sets of Words
Sort
View
IPPS
2010
IEEE
13 years 5 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
GIS
2005
ACM
14 years 8 months ago
In-network surface simplification for sensor fields
Recent research literature on sensor network databases has focused on finding ways to perform in-network aggregation of sensor readings to reduce the message cost. However, with t...
Brian Harrington, Yan Huang
JMLR
2008
116views more  JMLR 2008»
13 years 7 months ago
Support Vector Machinery for Infinite Ensemble Learning
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
Hsuan-Tien Lin, Ling Li
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 4 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
KDD
2000
ACM
133views Data Mining» more  KDD 2000»
13 years 11 months ago
Data selection for support vector machine classifiers
The problem of extracting a minimal number of data points from a large dataset, in order to generate a support vector machine (SVM) classifier, is formulated as a concave minimiza...
Glenn Fung, Olvi L. Mangasarian