240 search results - page 33 / 48 » Efficient Variants of the Backward-Oracle-Matching Algorithm |
65
Voted
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
104
click to vote
AI
2006
Springer
15 years 3 months ago
2006
Springer
We focus on clustering gene expression temporal profiles, and propose a novel, simple algorithm that is powerful enough to find an efficient distribution of genes over clusters. We...
EMNLP
2008
15 years 1 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
BNCOD
2004
15 years 1 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
DKE
2008
14 years 11 months ago
2008
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...