Sciweavers

2186 search results - page 363 / 438
» Considering an Organization's Memory
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 6 months ago
Efficient Resource Matching in Heterogeneous Grid Using Resource Vector
In this paper, a method for efficient scheduling to obtain optimum job throughput in a distributed campus grid environment is presented; Traditional job schedulers determine job s...
Srirangam V. Addepallil, Per Andersen, George L. B...
CORR
2010
Springer
74views Education» more  CORR 2010»
15 years 6 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
CORR
2006
Springer
67views Education» more  CORR 2006»
15 years 5 months ago
Reuse of designs: Desperately seeking an interdisciplinary cognitive approach
This text analyses the papers accepted for the workshop "Reuse of designs: an interdisciplinary cognitive approach" (Visser, 1993). Several dimensions and questions consi...
Willemien Visser, Brigitte Trousse
CORR
2006
Springer
91views Education» more  CORR 2006»
15 years 5 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux