Sciweavers

2168 search results - page 211 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
ICCV
2005
IEEE
16 years 20 days ago
KALMANSAC: Robust Filtering by Consensus
We propose an algorithm to perform causal inference of the state of a dynamical model when the measurements are corrupted by outliers. While the optimal (maximumlikelihood) soluti...
Andrea Vedaldi, Hailin Jin, Paolo Favaro, Stefano ...
ICALP
2009
Springer
16 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
16 years 7 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
175
Voted
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
16 years 18 days ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
ICPR
2006
IEEE
16 years 8 months ago
Robust Image Registration Based on Markov-Gibbs Appearance Model
A new approach to align an image of a textured object with a given prototype is proposed. Visual appearance of the images, after equalizing their signals, is modeled with a Markov...
Alaa E. Abdel-Hakim, Aly A. Farag, Ayman El-Baz, G...