Sciweavers

625 search results - page 4 / 125
» On one algorithm for solving the problem of source function ...
Sort
View
3DIM
2011
IEEE
12 years 7 months ago
Toward Automatic 3D Generic Object Modeling from One Single Image
We present a novel method for solving the challenging problem of generating 3D models of generic object categories from just one single un-calibrated image. Our method leverages t...
Min Sun, Shyam Sunder Kumar, Gary R. Bradski, Silv...
ICASSP
2008
IEEE
14 years 2 months ago
Sparse reconstruction by separable approximation
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
Stephen J. Wright, Robert D. Nowak, Mário A...
STACS
2010
Springer
14 years 2 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...
WSCG
2003
142views more  WSCG 2003»
13 years 9 months ago
Dynamic Radiosity using Higher Order Functions Bases and Temporal Coherence
The computation of global illumination in a dynamic scene constitutes a real challenge in computer graphics. In radiosity algorithms, this problem is far from being easy, especial...
Venceslas Biri, Sylvain Michelin, Didier Arqu&egra...
JCST
2008
134views more  JCST 2008»
13 years 7 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li