3192 search results - page 68 / 639 » The minimum latency problem |
100
click to vote
SKG
2006
IEEE
15 years 4 months ago
2006
IEEE
Predominant resources for execution of any application are computational power and memory. On one side, computational power has grown many folds faster than memory capacity. On th...
110
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
ICML
2007
IEEE
15 years 11 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
220
click to vote
COCOON
2011
Springer
13 years 9 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
157
click to vote
VLDB
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...