1658 search results - page 193 / 332 » Implementing Bit-addressing with Specialization |
136
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...
201
click to vote
VLDB
2007
ACM
16 years 4 months 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...
232
click to vote
SIGMOD
2006
ACM
16 years 4 months 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...
216
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...
152
click to vote
EDBT
2008
ACM
16 years 4 months 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...