2957 search results - page 367 / 592 » The Complexity of Polynomial-Time Approximation |
176
click to vote
CCCG
2008
15 years 8 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
183
click to vote
ECIS
2000
15 years 8 months ago
2000
Definitions of electronic commerce are many and varied. They indicate a lack of consensus about what electronic commerce is. `A `definition' implies a direct and unproblematic...
171
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
156
click to vote
MP
2008
15 years 6 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
153
click to vote
TOG
2008
15 years 6 months ago
2008
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...