100 search results - page 15 / 20 » Clustering with Soft and Group Constraints |
IEEEPACT
2002
IEEE
14 years 10 days ago
2002
IEEE
Modern embedded systems often require high degrees of instruction-level parallelism (ILP) within strict constraints on power consumption and chip cost. Unfortunately, a high-perfo...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
TASLP
2011
13 years 2 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
JSAC
2007
13 years 7 months ago
2007
— The large number of network nodes and the energy constraints make Wireless Sensor Networks (WSN) one of the most important application fields for Cooperative Diversity. Node c...
IJCAI
2007
13 years 8 months ago
2007
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...