Sciweavers

1199 search results - page 71 / 240
» Robust inference of trees
Sort
View
SIGECOM
2006
ACM
184views ECommerce» more  SIGECOM 2006»
15 years 10 months ago
Computing pure nash equilibria in graphical games via markov random fields
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
Constantinos Daskalakis, Christos H. Papadimitriou
WABI
2005
Springer
128views Bioinformatics» more  WABI 2005»
15 years 9 months ago
Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event
Abstract. The haplotype inference (HI) problem is the problem of inferring 2n haplotype pairs from n observed genotype vectors. This is a key problem that arises in studying geneti...
Yun S. Song, Yufeng Wu, Dan Gusfield
ICDE
2004
IEEE
100views Database» more  ICDE 2004»
16 years 5 months ago
Simple, Robust and Highly Concurrent B-trees with Node Deletion
Why might B-tree concurrency control still be interesting? For two reasons: (i) currently exploited "real world" approaches are complicated; (ii) simpler proposals are n...
David B. Lomet
IEICET
2010
113views more  IEICET 2010»
15 years 2 months ago
Probabilistic BPRRC: Robust Change Detection against Illumination Changes and Background Movements
This paper presents PrBPRRC (Probabilistic Bipolar Radial Reach Correlation), a change detection method that is robust against illumination changes and background movements. Most ...
Kentaro Yokoi
ISCAS
2008
IEEE
129views Hardware» more  ISCAS 2008»
15 years 10 months ago
Robust video multicast with joint network coding and AL-FEC
Abstract— Robust H.264/SVC video multicast with joint network coding (NC) and application-layer forward error correction (AL-FEC) is presented in this work. Unlike traditional AL...
Hui Wang, C. C. Jay Kuo