2024 search results - page 357 / 405 » Improving quality, one process change at a time |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...
AOR
2007
13 years 9 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
BMCBI
2010
13 years 9 months ago
2010
Background: Large-scale genomic studies often identify large gene lists, for example, the genes sharing the same expression patterns. The interpretation of these gene lists is gen...
SEMWEB
2009
Springer
14 years 3 months ago
2009
Springer
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
[Extended Abstract] Ken Wakita Tokyo Institute of Technology 2-12-1 Ookayama, Meguro-ku Tokyo 152-8552, Japan wakita@is.titech.ac.jp Toshiyuki Tsurumi Tokyo Institute of Technolog...