Sciweavers

1778 search results - page 276 / 356
» On the Power of the Randomized Iterate
Sort
View
ECCV
2006
Springer
16 years 8 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
ICIP
2005
IEEE
16 years 7 months ago
Collusion-resistant intentional de-synchronization for digital video fingerprinting
A powerful class of attacks in multimedia fingerprinting is known as collusion attacks, where a clique of colluders, each having a copy of the same multimedia content with differe...
Mehmet Kivanç Mihçak, Yinian Mao
ICIP
2009
IEEE
16 years 7 months ago
Seed Image Selection In Interactive Cosegmentation
Interactive image segmentation is a powerful paradigm that allows users to direct the segmentation algorithm towards a desired output. However, marking scribbles on multiple image...
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
16 years 6 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
16 years 6 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman