7351 search results - page 1319 / 1471 » Segmenting Point Sets |
128
click to vote
ENDM
2007
15 years 4 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
169
click to vote
JSAC
2006
15 years 4 months ago
2006
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...
146
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
125
click to vote
OL
2008
15 years 4 months ago
2008
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
159
click to vote
FUIN
2007
15 years 4 months ago
2007
Abstract. The notion of rules is very popular and appears in different flavors, for example as association rules in data mining or as functional dependencies in databases. Their s...