Sciweavers

1243 search results - page 75 / 249
» On the locality of bounded growth
Sort
View
ISCC
2006
IEEE
147views Communications» more  ISCC 2006»
14 years 4 months ago
An Analytical Tool to Assess Readiness of Existing Networks for Deploying IP Telephony
Deploying IP telephony or voice over IP (VoIP) is a major and challenging task. This paper describes an analytical approach and tool to assess the readiness of existing IP network...
Khaled Salah, M. Almashari
IPCO
2008
91views Optimization» more  IPCO 2008»
13 years 11 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
NIPS
2007
13 years 11 months ago
Adaptive Online Gradient Descent
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
Peter L. Bartlett, Elad Hazan, Alexander Rakhlin
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 10 months ago
Bit-size estimates for triangular sets in positive dimension
We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bo...
Xavier Dahan, Abdulilah Kadri, Éric Schost
CORR
2006
Springer
109views Education» more  CORR 2006»
13 years 10 months ago
Decision Making with Side Information and Unbounded Loss Functions
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly differe...
Majid Fozunbal, Ton Kalker