Sciweavers

15485 search results - page 524 / 3097
» Computing Optimal Subsets
Sort
View
ICPR
2008
IEEE
16 years 8 months ago
A discrete-time parallel update algorithm for distributed learning
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
Christian Bauckhage, Tansu Alpcan
KDD
2009
ACM
151views Data Mining» more  KDD 2009»
16 years 7 months ago
A LRT framework for fast spatial anomaly detection
Given a spatial data set placed on an n ? n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithm...
Mingxi Wu, Xiuyao Song, Chris Jermaine, Sanjay Ran...
ICPR
2008
IEEE
16 years 1 months ago
Ranking the local invariant features for the robust visual saliencies
Local invariant feature based methods have been proven to be effective in computer vision for object recognition and learning. But for an image, the number of points detected and ...
Shengping Xia, Peng Ren, Edwin R. Hancock
SIBGRAPI
2003
IEEE
16 years 8 days ago
A Non-Self-Intersection Douglas-Peucker Algorithm
The classical Douglas-Peucker line-simplification algorithm is recognized as the one that delivers the best perceptual representations of the original lines. It is used extensivel...
Shin-Ting Wu, Mercedes Rocío Gonzales M&aac...
265
Voted
COMPGEOM
2010
ACM
16 years 3 days ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan