Sciweavers

472 search results - page 35 / 95
» Design of Iterated Local Search Algorithms
Sort
View
PAMI
2010
184views more  PAMI 2010»
14 years 8 months ago
Accurate Image Search Using the Contextual Dissimilarity Measure
— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
Herve Jegou, Cordelia Schmid, Hedi Harzallah, Jako...
DCG
2010
137views more  DCG 2010»
14 years 9 months ago
Improved Results on Geometric Hitting Set Problems
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
Nabil H. Mustafa, Saurabh Ray
88
Voted
IDA
1999
Springer
15 years 1 months ago
Nonparametric Linear Discriminant Analysis by Recursive Optimization with Random Initialization
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
Mayer Aladjem
PLDI
2004
ACM
15 years 3 months ago
Fast searches for effective optimization phase sequences
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
93
Voted
ICDM
2007
IEEE
169views Data Mining» more  ICDM 2007»
15 years 1 months ago
Efficient Discovery of Frequent Approximate Sequential Patterns
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...
Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu