7015 search results - page 1062 / 1403 » Approximation algorithms for co-clustering |
207
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
208
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
237
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
188
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
175
click to vote
PAKDD
2010
ACM
15 years 4 months ago
2010
ACM
Data mining tasks results are usually improved by reducing the dimensionality of data. This improvement however is achieved harder in the case that data lay on a non linear manifol...