Sciweavers

3536 search results - page 540 / 708
» Local dependent components
Sort
View
PC
1998
153views Management» more  PC 1998»
15 years 5 months ago
Compilation Techniques for Out-of-Core Parallel Computations
The difficulty of handling out-of-core data limits the performance of supercomputers as well as the potential of the parallel machines. Since writing an efficient out-of-core ve...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
SIAMJO
2002
99views more  SIAMJO 2002»
15 years 5 months ago
Active Sets, Nonsmoothness, and Sensitivity
Nonsmoothness pervades optimization, but the way it typically arises is highly structured. Nonsmooth behavior of an objective function is usually associated, locally, with an activ...
A. S. Lewis
TON
1998
93views more  TON 1998»
15 years 5 months ago
An evaluation of flow control in group communication
Abstract— Group communication services have been successfully used to construct applications with high availability, dependability, and real-time responsiveness requirements. Flo...
Shivakant Mishra, Lei Wu
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 5 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 5 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg