Sciweavers

371 search results - page 62 / 75
» Case Study: Visualizing Sets of Evolutionary Trees
Sort
View
97
Voted
PAMI
2012
13 years 3 days ago
A Blur-Robust Descriptor with Applications to Face Recognition
—Understanding the effect of blur is an important problem in unconstrained visual analysis. We address this problem in the context of image-based recognition, by a fusion of imag...
Raghuraman Gopalan, Sima Taheri, Pavan K. Turaga, ...
RECOMB
1997
Springer
15 years 1 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
15 years 1 months ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
68
Voted
WALCOM
2007
IEEE
82views Algorithms» more  WALCOM 2007»
14 years 10 months ago
Methods for Searching Mutual Visible-Intervals on Moving Object
Abstract. Computing visible information, such as a visible surface determination, is a significant problem and has been mainly studied in the fields of computational geometry and...
Yoshiyuki Kusakari, Yuta Sugimoto, Junichi Notoya,...
INFOCOM
2009
IEEE
15 years 4 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...