Sciweavers

517 search results - page 18 / 104
» Separators in Two and Three Dimensions
Sort
View
JACM
2010
135views more  JACM 2010»
15 years 10 days ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan
ICPP
1989
IEEE
15 years 6 months ago
Efficient Serial and Parallel Algorithms for Median Filtering
We develop a serial algorithm for separable median filtering that requires only two comparisons per element when the window size is three. In addition, fast parallel CREW PRAM al...
Sanjay Ranka, Sartaj Sahni
INFORMS
1998
100views more  INFORMS 1998»
15 years 1 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
104
Voted
CVPR
2007
IEEE
16 years 3 months ago
Modeling Appearances with Low-Rank SVM
Several authors have noticed that the common representation of images as vectors is sub-optimal. The process of vectorization eliminates spatial relations between some of the near...
Lior Wolf, Hueihan Jhuang, Tamir Hazan
ACL
2007
15 years 3 months ago
A Feature Based Approach to Leveraging Context for Classifying Newsgroup Style Discussion Segments
On a multi-dimensional text categorization task, we compare the effectiveness of a feature based approach with the use of a stateof-the-art sequential learning technique that has ...
Yi-Chia Wang, Mahesh Joshi, Carolyn Penstein Ros&e...