Sciweavers

2607 search results - page 228 / 522
» Complete Functional Synthesis
Sort
View
WSCG
2003
145views more  WSCG 2003»
15 years 5 months ago
Real-Time Soft Shadows Using a Single Light Sample
We present a real-time rendering algorithm that generates soft shadows of dynamic scenes using a single light sample. As a depth-map algorithm it can handle arbitrary shadowed sur...
Florian Kirsch, Jürgen Döllner
IPCO
1992
100views Optimization» more  IPCO 1992»
15 years 5 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
CPC
2006
69views more  CPC 2006»
15 years 4 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...
IJCV
2008
105views more  IJCV 2008»
15 years 4 months ago
Detecting and Handling Unreliable Points for Camera Parameter Estimation
The popularly used DLT method sometimes fails to give reliable camera parameter estimation. It is therefore important to detect the unreliability and provide the corresponding solu...
Yihong Wu, Youfu Li, Zhanyi Hu
CORR
2007
Springer
99views Education» more  CORR 2007»
15 years 4 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic