16404 search results - page 283 / 3281 » A set coverage problem |
146
Voted
SIAMDM
2010
15 years 2 months ago
2010
We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
159
Voted
DAM
2011
14 years 11 months ago
2011
In this paper we tackle the problem of matching two colored point sets in R3 under the bottleneck distance. First we present an exact matching algorithm that requires the computat...
273
click to vote
ISMIS
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
141
Voted
JPDC
2011
14 years 7 months ago
2011
: One important problem which may arise in designing a deployment strategy for a wireless sensor network is how to deploy a specific number of sensor nodes throughout an unknown ne...
119
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a novel method to enhance training set for face detection with nonlinearly generated examples from the original data. The motivation is from Support Vector Machines (SV...