Sciweavers

1089 search results - page 51 / 218
» Bounds on generalized Frobenius numbers
Sort
View
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
13 years 11 months ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson
SACRYPT
2000
Springer
107views Cryptology» more  SACRYPT 2000»
13 years 11 months ago
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
It has recently been shown that when m > 1 2 n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf 2n-1 - 2m ,...
Yuliang Zheng, Xian-Mo Zhang
ICCV
2011
IEEE
12 years 7 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
CORR
2007
Springer
121views Education» more  CORR 2007»
13 years 7 months ago
Lower Bounds on Implementing Robust and Resilient Mediators
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks