847 search results - page 61 / 170 » Approximation algorithms for projective clustering |
125
Voted
IM
2007
15 years 12 days ago
2007
This paper describes Armil, a meta-search engine that groups the web snippets returned by auxiliary search engines into disjoint labeled clusters. The cluster labels generated by A...
66
Voted
ICIP
2007
IEEE
16 years 2 months ago
2007
IEEE
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
137
click to vote
TIP
2002
15 years 8 days ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
JSS
2006
2006
An empirical study of process-related attributes in segmented software cost-estimation relationships
15 years 18 days ago
Parametric software effort estimation models consisting on a single mathematical relationship suffer from poor adjustment and predictive characteristics in cases in which the hist...
158
click to vote
STOC
1998
ACM
15 years 4 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...