996 search results - page 119 / 200 » A general method to speed up fixed-parameter-tractable algor... |
135
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
149
click to vote
ICIP
2009
IEEE
15 years 2 months ago
2009
IEEE
Subspace-based methods rely on dominant element selection from second order statistics. They have been extended to tensor processing, in particular to tensor data filtering. For t...
144
Voted
EUC
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Well-scheduled communications, in conjunction with the aggregation of data reduce the energy waste on idle listening and redundant transmissions. In addition, the adjusta...
150
Voted
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
156
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Color values in an image are related to image irradiance by a nonlinear function called radiometric response function. Since this function depends on the aperture and the shutter ...