262 search results - page 36 / 53 » Approximating the 2-Interval Pattern Problem |
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connectio...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...
AUSAI
2004
Springer
14 years 2 months ago
2004
Springer
One problem many Web users encounter is to keep track of changes of distant Web sources. Push services, informing clients about data changes, are frequently not provided by Web ser...
NIPS
2001
13 years 10 months ago
2001
Massive transaction data sets are recorded in a routine manner in telecommunications, retail commerce, and Web site management. In this paper we address the problem of inferring p...