198 search results - page 33 / 40 » On the Lower Bound of Local Optimums in K-Means Algorithm |
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CRYPTO
2011
Springer
12 years 7 months ago
2011
Springer
RFID security is currently one of the major challenges cryptography has to face, often solved by protocols assuming that an on-tag hash function is available. In this article we pr...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
ICCV
2009
IEEE
15 years 10 days ago
2009
IEEE
We study the problem of estimating the epipolar geometry
from apparent contours of smooth curved surfaces
with affine camera models. Since apparent contours are
viewpoint depend...
ASIAMS
2007
IEEE
14 years 1 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...