1787 search results - page 168 / 358 » Approximation Techniques for Spatial Data |
146
click to vote
RECOMB
2005
Springer
16 years 5 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...
136
click to vote
IDA
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. This paper introduces a novel method for processing spotted microarray images, inspired from image reconstruction. Instead of the usual approach that focuses on the signa...
128
click to vote
ICWE
2010
Springer
15 years 9 months ago
2010
Springer
The recent proliferation of crowd computing initiatives on the web calls for smarter methodologies and tools to annotate, query and explore repositories. There is the need for scal...
173
click to vote
VISSYM
2007
15 years 7 months ago
2007
This paper is concerned with a multiresolution representation for maximum intensity projection (MIP) volume rendering based on morphological pyramids which allows progressive refi...
133
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...