Sciweavers

260 search results - page 36 / 52
» Quality guarantees for region optimal DCOP algorithms
Sort
View
CVPR
2010
IEEE
14 years 3 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
PVLDB
2010
110views more  PVLDB 2010»
13 years 5 months ago
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Hongzhi Wang, ...
COMPLIFE
2005
Springer
14 years 26 days ago
Fast and Accurate Structural RNA Alignment by Progressive Lagrangian Optimization
During the last few years new functionalities of RNA have been discovered, renewing the need for computational tools for their analysis. To this respect, multiple sequence alignmen...
Markus Bauer, Gunnar W. Klau, Knut Reinert
IJRR
2002
175views more  IJRR 2002»
13 years 7 months ago
Navigation Strategies for Exploring Indoor Environments
This paper investigates safe and efficient map-building strategies for a mobile robot with imperfect control and sensing. In the implementation, a robot equipped with a range sens...
Héctor H. González-Baños, Jea...
ALMOB
2006
155views more  ALMOB 2006»
13 years 7 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...