3894 search results - page 502 / 779 » Approximation Algorithms for Biclustering Problems |
133
click to vote
JCO
1998
15 years 3 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
104
click to vote
TMI
2002
15 years 3 months ago
2002
Abstract--We present an explicit formula for B-spline convolution kernels; these are defined as the convolution of several B-splines of variable widths and degrees . We apply our r...
131
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
We address the problem of computing the information leakage of a system in an efficient way. We propose two methods: one based on reducing the problem to reachability, and the oth...
121
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
— We present an approach that takes advantage of multi-packet reception (MPR) to reduce the negative effects of multiple access interference and therefore increase the capacity o...
129
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...