6142 search results - page 534 / 1229 » The Complexity of Partition Functions |
204
click to vote
ASC
2008
15 years 7 months ago
2008
This paper presents a methodology for automatically generating online scheduling strategies for a complex objective defined by a machine provider. To this end, we assume independe...
178
click to vote
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
178
click to vote
MP
2008
15 years 7 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 ...
164
click to vote
TOG
2008
15 years 7 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...
212
click to vote
EDBT
2011
ACM
14 years 10 months ago
2011
ACM
The quadratic form distance (QFD) has been utilized as an effective similarity function in multimedia retrieval, in particular, when a histogram representation of objects is used...