Sciweavers

1182 search results - page 176 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
ICML
2008
IEEE
16 years 20 days ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
SAC
2009
ACM
15 years 6 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
ACCV
2007
Springer
15 years 6 months ago
Simultaneous Appearance Modeling and Segmentation for Matching People Under Occlusion
We describe an approach to segmenting foreground regions corresponding to a group of people into individual humans. Given background subtraction and ground plane homography, hierar...
Zhe Lin, Larry S. Davis, David S. Doermann, Daniel...
IPPS
1999
IEEE
15 years 4 months ago
Large Scale Simulation of Particulate Flows
Simulations of particles in fluid flows are of great interest to numerous industries using sedimentation, fluidization, lubricated transport, and hydraulic fracturing of hydrocarb...
Ahmed H. Sameh, Vivek Sarin
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 4 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh