Sciweavers

340 search results - page 54 / 68
» Efficient algorithms for bichromatic separability
Sort
View
CVPR
2004
IEEE
15 years 11 months ago
Capturing Image Structure with Probabilistic Index Maps
One of the major problems in modeling images for vision tasks is that images with very similar structure may locally have completely different appearance, e.g., images taken under...
Nebojsa Jojic, Yaron Caspi
76
Voted
DAC
2006
ACM
15 years 10 months ago
Stochastic variational analysis of large power grids considering intra-die correlations
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
Praveen Ghanta, Sarma B. K. Vrudhula, Sarvesh Bhar...
TSMC
2008
100views more  TSMC 2008»
14 years 9 months ago
Instruction-Matrix-Based Genetic Programming
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...
Gang Li, Jin Feng Wang, Kin-Hong Lee, Kwong-Sak Le...
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 9 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
88
Voted
ICCV
2009
IEEE
16 years 2 months ago
Joint optimization of segmentation and appearance models
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
Sara Vicente, Vladimir Kolmogorov, Carsten Rother