31 search results - page 6 / 7 » Constrained LCS: Hardness and Approximation |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
ISCA
2010
IEEE
15 years 2 months ago
2010
IEEE
The performance of future manycore processors will only scale with the number of integrated cores if there is a corresponding increase in memory bandwidth. Projected scaling of el...
96
Voted
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
ZEUS
2010
14 years 11 months ago
2010
When designing a publicly available Web service, a service designer has to take care of costs and revenue caused by this services. In the very beginning possible partners might onl...
EOR
2010
14 years 9 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...