1051 search results - page 76 / 211 » Single Run Optimization Using the Reverse-Simulation Method |
188
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
179
click to vote
VIS
2004
IEEE
16 years 6 months ago
2004
IEEE
Typically there is a high coherence in data values between neighboring time steps in an iterative scientific software simulation; this characteristic similarly contributes to a co...
160
click to vote
ISSTA
2009
ACM
15 years 11 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
176
click to vote
CVPR
2011
IEEE
15 years 29 days ago
2011
IEEE
In this paper we reformulate the 3D reconstruction of deformable surfaces from monocular video sequences as a labeling problem. We solve simultaneously for the assignment of featu...
135
click to vote
GECCO
2003
Springer
15 years 10 months ago
2003
Springer
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...