9871 search results - page 55 / 1975 » On the Structure of Low Sets |
IANDC
2010
13 years 7 months ago
2010
The structure map turning a set into the carrier of a final coalgebra is not unique. This fact is well-known but commonly elided. In this paper we argue that any such concrete re...
PAMI
2006
13 years 9 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Recently great interest has been shown in the visual surveillance of public transportation systems. The challenge is the automated analysis of passenger’s behaviors with a set o...
DM
2008
13 years 9 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
The remote file synchronization problem is how to update an outdated version of a file located on one machine to the current version located on another machine with a minimal am...