6142 search results - page 585 / 1229 » The Complexity of Partition Functions |
298
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
287
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
Fast level set methods replace continuous PDEs by a discrete formulation, improving the execution times. The regularization in fast level set methods was so far handled indirectly...
228
click to vote
DAC
2004
ACM
16 years 8 months ago
2004
ACM
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
181
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
218
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...