Sciweavers

6110 search results - page 1190 / 1222
» Approximate Computing
Sort
View
AIIA
2005
Springer
15 years 3 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
COCOON
2005
Springer
15 years 3 months ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving...
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
15 years 3 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ICCS
2005
Springer
15 years 3 months ago
Flamelet Analysis of Turbulent Combustion
Three-dimensional direct numerical simulations are performed of turbulent combustion of initially spherical flame kernels. The chemistry is described by a progress variable which ...
R. J. M. Bastiaans, S. M. Martin, H. Pitsch, J. A....
« Prev « First page 1190 / 1222 Last » Next »