4886 search results - page 763 / 978 » Approximate Data Exchange |
128
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
130
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
150
click to vote
CNSR
2008
IEEE
15 years 11 months ago
2008
IEEE
Signal processing techniques have been applied recently for analyzing and detecting network anomalies due to their potential to find novel or unknown intrusions. In this paper, we...
169
click to vote
ICIW
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we present an extension of PHIL, a declarative language for filtering information from XML data. The proposed approach allows us to extract relevant data as well a...
134
Voted
ICPP
2008
IEEE
15 years 10 months ago
2008
IEEE
Similarity search has been widely studied in peer-to-peer environments. In this paper, we propose the Bounded Locality Sensitive Hashing (Bounded LSH) method for similarity search...