83 search results - page 3 / 17 » On Exact and Approximation Algorithms for Distinguishing Sub... |
ISAAC
2009
Springer
14 years 16 days ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
ICPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Kernel logistic regression models, like their linear counterparts, can be trained using the efficient iteratively reweighted least-squares (IRWLS) algorithm. This approach suggest...
VLDB
2007
ACM
14 years 6 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
ICDE
2008
IEEE
14 years 7 months ago
2008
IEEE
In recent years, there has been significant interest in development of ranking functions and efficient top-k retrieval algorithms to help users in ad-hoc search and retrieval in da...
ESANN
2007
13 years 7 months ago
2007
Abstract. The convex optimisation problem involved in fitting a kernel probit regression (KPR) model can be solved efficiently via an iteratively re-weighted least-squares (IRWLS)...