Sciweavers

6365 search results - page 101 / 1273
» Fast Local Computation Algorithms
Sort
View
156
Voted
ECCV
2006
Springer
16 years 4 months ago
A Fast Line Segment Based Dense Stereo Algorithm Using Tree Dynamic Programming
Many traditional stereo correspondence methods emphasized on utilizing epipolar constraint and ignored the information embedded in inter-epipolar lines. Actually some researchers h...
Yi Deng, Xueyin Lin
ICIP
2010
IEEE
15 years 16 days ago
Fast and robust active contours for image segmentation
Active models are widely used in applications like image segmentation and tracking. Region-based active models are known for robustness to weak edges and high computational comple...
Wei Yu, Franz Franchetti, Yao-Jen Chang, Tsuhan Ch...
128
Voted
GECCO
2000
Springer
225views Optimization» more  GECCO 2000»
15 years 6 months ago
Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm
A genetic local search (GLS) algorithm, which is a combination technique of genetic algorithm and local search, for the unconstrained binary quadratic programming problem (BQP) is...
Kengo Katayama, Masafumi Tani, Hiroyuki Narihisa
122
Voted
SPAA
2009
ACM
16 years 3 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
SC
2009
ACM
15 years 7 months ago
A framework for core-level modeling and design of reconfigurable computing algorithms
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...