Sciweavers

3630 search results - page 380 / 726
» Fast Marching Methods
Sort
View
CGF
2008
109views more  CGF 2008»
15 years 5 months ago
Occlusion Textures for Plausible Soft Shadows*
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...
Elmar Eisemann, Xavier Décoret
139
Voted
CHINAF
2008
69views more  CHINAF 2008»
15 years 5 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang
126
Voted
CORR
2006
Springer
105views Education» more  CORR 2006»
15 years 5 months ago
Generalization error bounds in semi-supervised classification under the cluster assumption
We consider semi-supervised classification when part of the available data is unlabeled. These unlabeled data can be useful for the classification problem when we make an assumpti...
Philippe Rigollet
EOR
2006
70views more  EOR 2006»
15 years 5 months ago
Heuristics for matrix bandwidth reduction
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
Andrew Lim, Brian Rodrigues, Fei Xiao
126
Voted
JUCS
2008
138views more  JUCS 2008»
15 years 4 months ago
A New and Efficient Algorithm to Binarize Document Images Removing Back-to-Front Interference
: "Back-to-front interference", "bleeding" and "show-through" is the name given to the phenomenon found whenever documents are written on both sides o...
João Marcelo Monte da Silva, Rafael Dueire ...