Sciweavers

925 search results - page 158 / 185
» Connectivity on Complete Lattices
Sort
View
ICPP
2009
IEEE
14 years 2 months ago
Improving Resource Availability by Relaxing Network Allocation Constraints on Blue Gene/P
— High-end computing (HEC) systems have passed the petaflop barrier and continue to move toward the next frontier of exascale computing. As companies and research institutes con...
Narayan Desai, Darius Buntinas, Daniel Buettner, P...
BIRTHDAY
2005
Springer
14 years 27 days ago
Still
Keywords Name of the disease and synonyms Definition/Diagnostic criteria Juvenile form Comments on the differential diagnosis Incidence Clinical description Method of biological d...
Alice ter Meulen
IUI
2004
ACM
14 years 24 days ago
An intelligent assistant for interactive workflow composition
Complex applications in many areas, including scientific computations and business-related web services, are created from collections of components to form workflows. In many case...
Jihie Kim, Marc Spraragen, Yolanda Gil
CVPR
1996
IEEE
13 years 11 months ago
Extracting Salient Curves from Images: An Analysis of the Saliency Network
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
T. D. Alter, Ronen Basri
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman