1974 search results - page 304 / 395 » On Unbiased Linear Approximations |
RECOMB
2005
Springer
15 years 10 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...
102
click to vote
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
SIGMOD
2004
ACM
15 years 10 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
107
click to vote
PODS
2001
ACM
15 years 10 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...