4112 search results - page 470 / 823 » Efficient Algorithms for the Spoonerism Problem |
205
click to vote
COR
2006
15 years 7 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
229
click to vote
KDD
2008
ACM
16 years 8 months ago
2008
ACM
Multi-label problems arise in various domains such as multitopic document categorization and protein function prediction. One natural way to deal with such problems is to construc...
228
click to vote
APPROX
2008
Springer
15 years 9 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
254
click to vote
KDD
2003
ACM
16 years 8 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
231
click to vote
ICCAD
1999
IEEE
15 years 12 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...