16404 search results - page 765 / 3281 » A set coverage problem |
225
click to vote
AI
2005
Springer
16 years 1 months ago
2005
Springer
In this research, a systematic study is conducted of four dimension reduction techniques for the text clustering problem, using five benchmark data sets. Of the four methods -- Ind...
171
click to vote
VLDB
2005
ACM
16 years 29 days ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
193
click to vote
ICALP
2004
Springer
16 years 26 days ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
223
click to vote
CVPR
2003
IEEE
16 years 23 days ago
2003
IEEE
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
172
Voted
GECCO
2003
Springer
16 years 21 days ago
2003
Springer
We identify classes of functions for which a No Free Lunch result does and does not hold, with particular emphasis on the relationship between No Free Lunch and problem description...