Sciweavers

3678 search results - page 23 / 736
» On the Stable Paths Problem
Sort
View
RECOMB
2006
Springer
14 years 10 months ago
Probabilistic Paths for Protein Complex Inference
Understanding how individual proteins are organized into complexes and pathways is a significant current challenge. We introduce new algorithms to infer protein complexes by combin...
Hailiang Huang, Lan V. Zhang, Frederick P. Roth, J...
IROS
2007
IEEE
167views Robotics» more  IROS 2007»
14 years 4 months ago
Path following control for tracked vehicles based on slip-compensating odometry
— Tracked vehicles have the advantage of stable locomotion on uneven terrain, and, as a result, such mechanisms are used for locomotion on outdoor robots, including those used fo...
Daisuke Endo, Yoshito Okada, Keiji Nagatani, Kazuy...
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 7 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
ISBI
2011
IEEE
13 years 1 months ago
Hippocampus segmentation using a stable maximum likelihood classifier ensemble algorithm
We develop a new algorithm to segment the hippocampus from MR images. Our method uses a new classifier ensemble algorithm to correct segmentation errors produced by a multi-atlas...
Hongzhi Wang, Jung Wook Suh, Sandhitsu R. Das, Mur...
MP
2006
142views more  MP 2006»
13 years 9 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford