Sciweavers

3049 search results - page 489 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
GLOBECOM
2007
IEEE
13 years 9 months ago
On Static Code Construction for Alternating Multicast and Simultaneous Multicasts
— In this paper, we introduce a network multicast problem called the alternating multicast problem. In this problem, there is more than one multicast on the network, but only one...
Chi Kin Ngai, Shenghao Yang, Raymond W. Yeung
CGF
2008
139views more  CGF 2008»
13 years 9 months ago
CHC++: Coherent Hierarchical Culling Revisited
We present a new algorithm for efficient occlusion culling using hardware occlusion queries. The algorithm significantly improves on previous techniques by making better use of te...
Oliver Mattausch, Jirí Bittner, Michael Wim...
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 9 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
JEA
2006
90views more  JEA 2006»
13 years 9 months ago
Heuristics for estimating contact area of supports in layered manufacturing
Layered Manufacturing is a technology that allows physical prototypes of three-dimensional models to be built directly from their digital representation, as a stack of two-dimensi...
Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid,...
COLT
2010
Springer
13 years 7 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari