167 search results - page 30 / 34 » On the complexity and approximation of syntenic distance |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
ALMOB
2006
13 years 8 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
ISMIS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...