Sciweavers

835 search results - page 62 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
MP
2010
128views more  MP 2010»
13 years 9 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
ICALP
2011
Springer
13 years 2 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
IROS
2007
IEEE
136views Robotics» more  IROS 2007»
14 years 5 months ago
A bounded uncertainty approach to cooperative localization using relative bearing constraints
— This paper describes an approach to cooperative localization which finds its roots in robust estimation, employing an unknown-but-bounded error model for sensor measurements. ...
Camillo J. Taylor, John R. Spletzer
INFOCOM
2002
IEEE
14 years 3 months ago
A Framework for Optimal Battery Management for Wireless Nodes
The focus of this paper is to extend the lifetime of a battery powered node in wireless context. The lifetime of a battery depends on both the manner of discharge and the transmis...
Maria Adamou, Saswati Sarkar