16404 search results - page 2767 / 3281 » A set coverage problem |
160
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
160
click to vote
DEBU
2010
15 years 7 months ago
2010
A major hardness of processing searches issued in the form of keywords on structured data is the ambiguity problem. A set of keywords itself is not a complete piece of information...
173
click to vote
CSDA
2008
15 years 7 months ago
2008
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
271
click to vote
DC
2008
15 years 7 months ago
2008
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
195
click to vote
DCG
2008
15 years 7 months ago
2008
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...