Sciweavers

3894 search results - page 514 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Sequential Monte Carlo method for parameter estimation in diffusion models of affinity-based biosensors
Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
Manohar Shamaiah, Xiaohu Shen, Haris Vikalo
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 4 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
VTC
2006
IEEE
118views Communications» more  VTC 2006»
15 years 10 months ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
CVPR
2006
IEEE
16 years 6 months ago
Improving Border Localization of Multi-Baseline Stereo Using Border-Cut
This paper presents a novel algorithm that improves the localization of disparity discontinuities of disparity maps obtained by multi-baseline stereo. Rather than associating a di...
Marc-Antoine Drouin, Martin Trudeau, Sébast...
RECOMB
2006
Springer
16 years 4 months ago
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Abstract. During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chrom...
Martin Bader, Enno Ohlebusch