Sciweavers

867 search results - page 39 / 174
» The Generalized Maximum Coverage Problem
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Automatic retrieval of similar content using search engine query interface
We consider the coverage testing problem where we are given a document and a corpus with a limited query interface and asked to find if the corpus contains a near-duplicate of th...
Ali Dasdan, Paolo D'Alberto, Santanu Kolay, Chris ...
UAI
2004
13 years 9 months ago
The Minimum Information Principle for Discriminative Learning
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
Amir Globerson, Naftali Tishby
PAMI
2008
134views more  PAMI 2008»
13 years 8 months ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
14 years 6 days ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
ESA
2006
Springer
103views Algorithms» more  ESA 2006»
13 years 11 months ago
Greedy in Approximation Algorithms
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
Julián Mestre