3510 search results - page 433 / 702 » Searching with numbers |
165
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
202
click to vote
ICPR
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Searching large image databases is a time consuming process when done manually. Current CBIR methods mostly rely on training data in specific domains. When source and dom...
184
click to vote
ICTAI
2010
IEEE
15 years 4 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
192
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
205
click to vote
HIPC
2009
Springer
15 years 4 months ago
2009
Springer
Recently proposed techniques for peak power management [18] involve centralized decisionmaking and assume quick evaluation of the various power management states. These techniques...