270 search results - page 27 / 54 » Partitioning into Sets of Bounded Cardinality |
101
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
Segmentation algorithms based on an energy minimisation framework often depend on a scale parameter which balances a fit to data and a regularising term. Irregular pyramids are de...
121
Voted
ICALP
2001
Springer
15 years 6 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
111
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
157
Voted
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...
117
click to vote
DM
2008
15 years 1 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...