Sciweavers

1439 search results - page 114 / 288
» Bagging with Adaptive Costs
Sort
View
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 7 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
IDMS
2001
Springer
116views Multimedia» more  IDMS 2001»
14 years 11 days ago
The Minimal Buffering Requirements of Congestion Controlled Interactive Multimedia Applications
This paper uses analysis and experiments to study the minimal buffering requirements of congestion controlled multimedia applications. Applications in the Internet must use congest...
Kang Li, Charles Krasic, Jonathan Walpole, Molly H...
ACISP
2005
Springer
14 years 1 months ago
Group Signature Schemes with Membership Revocation for Large Groups
Group signature schemes with membership revocation have been intensively researched. However, signing and/or verification of some existing schemes have computational costs of O(R)...
Toru Nakanishi, Fumiaki Kubooka, Naoto Hamada, Nob...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 1 months ago
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...
Cristian-Augustin Saita, François Llirbat
IPPS
2003
IEEE
14 years 1 months ago
Targeting Tiled Architectures in Design Exploration
Tiled architectures can provide a model for early estimation of global interconnect costs. A design exploration tool for reconfigurable architectures is currently under developmen...
Lilian Bossuet, Wayne Burleson, Guy Gogniat, Vikas...