Sciweavers

52 search results - page 6 / 11
» A comparison of tight generalization error bounds
Sort
View
TOG
2008
139views more  TOG 2008»
14 years 11 months ago
Logarithmic perspective shadow maps
We present a novel shadow map parameterization to reduce perspective aliasing artifacts for both point and directional light sources. We derive the aliasing error equations for bo...
Brandon Lloyd, Naga K. Govindaraju, Cory Quammen, ...
97
Voted
COLT
2006
Springer
15 years 2 months ago
A Randomized Online Learning Algorithm for Better Variance Control
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
Jean-Yves Audibert
PVLDB
2010
131views more  PVLDB 2010»
14 years 9 months ago
XSACT: A Comparison Tool for Structured Search Results
Studies show that about 50% of web search is for information exploration purpose, where a user would like to investigate, compare, evaluate, and synthesize multiple relevant resul...
Ziyang Liu, Sivaramakrishnan Natarajan, Peng Sun, ...
ECCC
2011
202views ECommerce» more  ECCC 2011»
14 years 6 months ago
New strong direct product results in communication complexity
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
Rahul Jain
DAC
2004
ACM
16 years 20 hour ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay