Sciweavers

1234 search results - page 171 / 247
» Ontology Based Analysis of Experimental Data
Sort
View
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 1 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
ESA
2006
Springer
134views Algorithms» more  ESA 2006»
15 years 1 months ago
An Improved Construction for Counting Bloom Filters
A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
EUROPAR
2008
Springer
14 years 11 months ago
Mapping Heterogeneous Distributed Applications on Clusters
Performance of distributed applications largely depends on the mapping of their components on the underlying architecture. On one mponent-based approaches provide an abstraction su...
Sylvain Jubertie, Emmanuel Melin, Jér&eacut...
AIPRF
2008
14 years 11 months ago
A Coherent and Heterogeneous Approach to Clustering
Despite outstanding successes of the state-of-the-art clustering algorithms, many of them still suffer from shortcomings. Mainly, these algorithms do not capture coherency and homo...
Arian Maleki, Nima Asgharbeygi
NAACL
2004
14 years 11 months ago
Discriminative Reranking for Machine Translation
This paper describes the application of discriminative reranking techniques to the problem of machine translation. For each sentence in the source language, we obtain from a basel...
Libin Shen, Anoop Sarkar, Franz Josef Och