275 search results - page 41 / 55 » On the computational power of iterative auctions |
SC
2009
ACM
15 years 4 months ago
2009
ACM
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
107
click to vote
CLUSTER
2000
IEEE
15 years 2 months ago
2000
IEEE
The present study treats the calculation of the continuous phase of a multiphase flow, i.e. the numerical solution of the equations for a turbulent incompressible flow. An exist...
83
Voted
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
The objective of active recognition is to iteratively collect the next "best" measurements (e.g., camera angles or viewpoints), to maximally reduce ambiguities in recogn...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
OOPSLA
2009
Springer
15 years 4 months ago
2009
Springer
Side effects are both the essence and bane of imperative programming. The programmer must carefully coordinate actions to manage their side effects upon each other. Such coordinat...