17 search results - page 2 / 4 » A Faster Algorithm for Finding Minimum Tucker Submatrices |
DCOSS
2007
Springer
13 years 9 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Microarray datasets typically contain large number of columns but small number of rows. Association rules have been proved to be useful in analyzing such datasets. However, most e...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are ...
IJCAI
2003
13 years 6 months ago
2003
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
IJMC
2006
13 years 5 months ago
2006
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...