1746 search results - page 247 / 350 » A linear implementation of PACMAN |
138
click to vote
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
157
click to vote
STOC
2001
ACM
16 years 4 months ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
142
click to vote
OSDI
2008
ACM
16 years 4 months ago
2008
ACM
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-...
218
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
155
click to vote
PODS
2003
ACM
16 years 4 months ago
2003
ACM
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...