6142 search results - page 385 / 1229 » The Complexity of Partition Functions |
202
click to vote
TVCG
2011
15 years 1 months ago
2011
— The growing sizes of volumetric data sets pose a great challenge for interactive visualization. In this paper, we present a feature-preserving data reduction and focus+context ...
175
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computat...
148
click to vote
IROS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires c...
142
Voted
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
A novel and rigorous Multi-perturbation Shapley Value Analysis (MSA) method has been recently presented [12]. The method addresses the challenge of defining and calculating the fu...
157
click to vote
PPSN
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...