17541 search results - page 3240 / 3509 » Complexity in scalable computing |
142
click to vote
JSA
2000
15 years 4 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
146
click to vote
CGF
2008
15 years 4 months ago
2008
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
141
click to vote
PVLDB
2008
15 years 4 months ago
2008
Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the o...
155
click to vote
RV
2010
Springer
15 years 3 months ago
2010
Springer
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
154
click to vote
BMVC
2010
15 years 2 months ago
2010
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...