Sciweavers

4698 search results - page 64 / 940
» Making Functionality More General
Sort
View
ICCV
2009
IEEE
16 years 9 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
JOC
2000
95views more  JOC 2000»
15 years 5 months ago
Player Simulation and General Adversary Structures in Perfect Multiparty Computation
The goal of secure multiparty computation is to transform a given protocol involving a trusted party into a protocol without need for the trusted party, by simulating the party am...
Martin Hirt, Ueli M. Maurer
PAMI
2008
134views more  PAMI 2008»
15 years 6 months ago
Bittracker - A Bitmap Tracker for Visual Tracking under Very General Conditions
This paper addresses the problem of visual tracking under very general conditions: a possibly nonrigid target whose appearance may drastically change over time, general camera moti...
Ido Leichter, Michael Lindenbaum, Ehud Rivlin
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 11 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 6 months ago
Concurrent general composition of secure protocols in the timing model
In the setting of secure multiparty computation, a set of parties wish to to jointly compute some function of their input (i.e., they wish to securely carry out some distributed t...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...