415 search results - page 43 / 83 » An efficient approximation for the Generalized Assignment Pr... |
RECOMB
2006
Springer
14 years 10 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
PR
2000
13 years 9 months ago
2000
Deterministic annealing and relaxation labeling algorithms for classification and matching are presented and discussed. A new approach--self annealing--is introduced to bring dete...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...