16404 search results - page 293 / 3281 » A set coverage problem |
142
Voted
DMIN
2006
15 years 6 months ago
2006
- Clustering of data is an important data mining application. One of the problems with traditional partitioning clustering methods is that they partition the data into hard bound n...
152
click to vote
GMP
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract. This paper considers the problem of computing an interpolating skin of a ordered set of discrete 2D balls. By construction, the skin is constrained to be C1 continuous, a...
145
click to vote
DEBU
2010
15 years 4 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
139
click to vote
CMOT
2006
15 years 4 months ago
2006
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Acc...
123
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— The problem of designing high rate, full diversity noncoherent space-time block codes (STBCs) with low encoding and decoding complexity is addressed. First, the notion of g-gro...