273 search results - page 55 / 55 » Can Pure Cutting Plane Algorithms Work |
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
VR
2009
IEEE
13 years 11 months ago
2009
IEEE
High resolution 2D video content in High Definition or higher resolutions has become widespread and video playback of such media in immersive virtual environments (VE) will be a ...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...