727 search results - page 121 / 146 » One line and n points |
DATAMINE
2006
14 years 10 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the question of the stability of evolutionary algorithms to gradual changes, or drift, in the target concept. We define an algorithm to be resistant to drift if, for s...
IACR
2011
13 years 9 months ago
2011
Program Obfuscation is the problem of transforming a program into one which is functionally equivalent, yet whose inner workings are completely unintelligible to an adversary. Des...
ECSQARU
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We address the problem of providing a logical characterization of reasoning based on stereotypes. Following [6] we take a semantic perspective and we base our model on a ...
CIVR
2007
Springer
15 years 4 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...