Sciweavers

1887 search results - page 233 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
PAMI
2008
174views more  PAMI 2008»
13 years 9 months ago
Multiflash Stereopsis: Depth-Edge-Preserving Stereo with Small Baseline Illumination
Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness co...
Rogerio Feris, Ramesh Raskar, Longbin Chen, Kar-Ha...
RECOMB
2008
Springer
14 years 9 months ago
Computation of Median Gene Clusters
Whole genome comparison based on gene order has become a popular approach in comparative genomics. An important task in this field is the detection of gene clusters, i.e. sets of g...
Sebastian Böcker, Katharina Jahn, Julia Mixta...
TSI
2008
89views more  TSI 2008»
13 years 9 months ago
RedGRID, un environnement pour la redistribution d'objets complexes
In the context of code coupling, efficient data redistribution is a crucial issue to reach high-performances. However, most of the works in this area have limited their studies to ...
Aurélien Esnard
GCB
2004
Springer
223views Biometrics» more  GCB 2004»
14 years 28 days ago
PoSSuMsearch: Fast and Sensitive Matching of Position Specific Scoring Matrices using Enhanced Suffix Arrays
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...
Michael Beckstette, Dirk Strothmann, Robert Homann...
IS
2008
13 years 9 months ago
Continuous subspace clustering in streaming time series
Performing data mining tasks in streaming data is considered a challenging research direction, due to the continuous data evolution. In this work, we focus on the problem of clust...
Maria Kontaki, Apostolos N. Papadopoulos, Yannis M...