4903 search results - page 411 / 981 » The Set Covering Machine |
194
click to vote
SIGCOMM
2009
ACM
16 years 2 months ago
2009
ACM
It is envisaged that services and applications will migrate to a cloud-computing paradigm where thin-clients on userdevices access, over the network, applications hosted in data c...
189
click to vote
ICALP
2003
Springer
16 years 28 days ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
230
click to vote
KES
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This work proposes a family of language-independent semantic kernel functions defined for individuals in an ontology. This allows exploiting wellfounded kernel methods fo...
204
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
247
click to vote
ISMB
2000
15 years 9 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...