30 search results - page 3 / 6 » Optimal centers in branch-and-prune algorithms for univariat... |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The design of sensor networks capable of reaching a consensus on a globally optimal decision test, without the need for a fusion center, is a problem that has received considerable...
TKDE
2008
13 years 6 months ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
CISS
2010
IEEE
12 years 9 months ago
2010
IEEE
—This paper addresses optimal spectrum sensing in cognitive radio networks considering its system level cost that accounts for the local processing cost of sensing (sample collec...
EAAI
2008
13 years 6 months ago
2008
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
ICDM
2006
IEEE
14 years 4 days ago
2006
IEEE
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...