1658 search results - page 193 / 332 » Implementing Bit-addressing with Specialization |
107
Voted
RECOMB
2005
Springer
16 years 26 days 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...
173
click to vote
VLDB
2007
ACM
16 years 23 days ago
2007
ACM
In large-scale distributed information systems, where participants are autonomous and have special interests for some queries, query allocation is a challenge. Much work in this c...
203
Voted
SIGMOD
2006
ACM
16 years 21 days ago
2006
ACM
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
185
Voted
SIGMOD
2006
ACM
16 years 21 days 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...
124
Voted
EDBT
2008
ACM
16 years 20 days ago
2008
ACM
In the paper we discuss the problem of data integration in a P2P environment. In such setting each peer stores schema of its local data, mappings between the schema and schemas of...