Sciweavers

1814 search results - page 225 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CVPR
2009
IEEE
17 years 1 months ago
Appearance-based Keypoint Clustering
We present an algorithm for clustering sets of detected interest points into groups that correspond to visually dis- tinct structure. Through the use of a suitable colour and tex...
Francisco J. Estrada, Pascal Fua, Sabine Süss...
ICIP
1997
IEEE
16 years 8 months ago
An adaptive interpolation scheme for 2-D mesh motion compensation
Two dimensional mesh motion compensation produces blocking free prediction in contrast to block matching motion compensation by generating a smooth full motion field from the set ...
Pohsiang Hsu, K. J. Ray Liu, Tsuhan Chen
ICDE
2006
IEEE
130views Database» more  ICDE 2006»
16 years 8 months ago
MIC Framework: An Information-Theoretic Approach to Quantitative Association Rule Mining
We propose a framework, called MIC, which adopts an information-theoretic approach to address the problem of quantitative association rule mining. In our MIC framework, we first d...
Yiping Ke, James Cheng, Wilfred Ng
ICPR
2006
IEEE
16 years 7 months ago
ECOC-ONE: A Novel Coding and Decoding Strategy
Error correcting output codes (ECOC) represent a classification technique that allows a successful extension of binary classifiers to address the multiclass problem. In this paper...
Oriol Pujol, Sergio Escalera
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
16 years 1 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku