321 search results - page 30 / 65 » Comparison of Additive Trees Using Circular Orders |
CPAIOR
2007
Springer
15 years 6 months ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
TVCG
2010
14 years 10 months ago
2010
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
133
click to vote
JMLR
2010
14 years 6 months ago
2010
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
191
click to vote
FCCM
2011
IEEE
14 years 3 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
This paper describes a novel approach using Hidden Markov Models (HMM) to detect complex Internet attacks. These attacks consist of several steps that may occur over an extended pe...