2489 search results - page 223 / 498 » On the Subgroup Distance Problem |
142
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
285
click to vote
SIGMOD
2005
ACM
16 years 5 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
113
click to vote
EDBT
2008
ACM
16 years 5 months ago
2008
ACM
Index trees created using distance based indexing are difficult to maintain online since the distance function involved is often costly to compute. This problem is intensified whe...
141
click to vote
PERCOM
2005
ACM
16 years 4 months ago
2005
ACM
IEEE 802.11 and Mote devices are today two of the most interesting wireless technologies for ad hoc and sensor networks respectively, and many efforts are currently devoted to und...
150
Voted
EVOW
2009
Springer
15 years 11 months ago
2009
Springer
We present a hybrid evolutionary algorithm for the graph coloring problem (Evocol). Evocol is based on two simple-but-effective ideas. First, we use an enhanced crossover that col...