Sciweavers

736 search results - page 51 / 148
» High-order functions and their ordering relations
Sort
View
SAC
2009
ACM
15 years 6 months ago
Exploiting weak dependencies in tree-based search
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
Alejandro Arbelaez, Youssef Hamadi
COOPIS
2004
IEEE
15 years 3 months ago
Automatic Initiation of an Ontology
We report on an a set of experiments carried out in the context of the Flemish OntoBasis project. Our purpose is to extract semantic relations from text corpora in an unsupervised ...
Marie-Laure Reinberger, Peter Spyns, A. Johannes P...
CORR
2006
Springer
110views Education» more  CORR 2006»
14 years 12 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
WECWIS
2006
IEEE
97views ECommerce» more  WECWIS 2006»
15 years 5 months ago
On State Synchronization of Business Conversations
The paper assumes that business interactions between trading partners are composed of well defined conversations (tasks), such as issue a purchase order, process payment, refund m...
Carlos Molina-Jiménez, Santosh K. Shrivasta...
WABI
2001
Springer
138views Bioinformatics» more  WABI 2001»
15 years 4 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permut...
Steffen Heber, Jens Stoye