Sciweavers

2014 search results - page 77 / 403
» A P2P Approach for Global Computing
Sort
View
3DIM
2005
IEEE
15 years 10 months ago
Fitting of 3D Circles and Ellipses Using a Parameter Decomposition Approach
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
Xiaoyi Jiang, Da-Chuan Cheng
PG
2007
IEEE
15 years 10 months ago
Practical Global Illumination for Hair Rendering
Both hair rendering and global illumination are known to be computationally expensive, and for this reason we see very few examples using global illumination techniques in hair re...
Cem Yuksel, Ergun Akleman, John Keyser
ECCV
2008
Springer
16 years 6 months ago
Hierarchical Support Vector Random Fields: Joint Training to Combine Local and Global Features
Abstract. Recently, impressive results have been reported for the detection of objects in challenging real-world scenes. Interestingly however, the underlying models vary greatly e...
Paul Schnitzspan, Mario Fritz, Bernt Schiele
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 8 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
RECOMB
2007
Springer
16 years 4 months ago
Learning Gene Regulatory Networks via Globally Regularized Risk Minimization
Learning the structure of a gene regulatory network from time-series gene expression data is a significant challenge. Most approaches proposed in the literature to date attempt to ...
Yuhong Guo, Dale Schuurmans