536 search results - page 75 / 108 » The hardness and approximation algorithms for l-diversity |
196
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
205
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
Multi-task learning (MTL) aims to improve the performance of multiple related tasks by exploiting the intrinsic relationships among them. Recently, multi-task feature learning alg...
183
click to vote
SPAA
2004
ACM
15 years 11 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
171
click to vote
WISEC
2009
ACM
16 years 1 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
166
click to vote
ESA
2007
Springer
16 years 13 days ago
2007
Springer
We study the problem of scheduling transmissions on the downlink of IEEE 802.16/WiMAX systems that use the OFDMA technology. These transmissions are scheduled using a matrix whose...