3006 search results - page 315 / 602 » Dimensionality reduction and generalization |
126
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
218
click to vote
AI
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Subspace mapping methods aim at projecting high-dimensional data into a subspace where a specific objective function is optimized. Such dimension reduction allows the re...
180
click to vote
LCTRTS
2009
Springer
16 years 1 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
214
click to vote
COCO
2005
Springer
16 years 7 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
175
click to vote
AAAI
1993
15 years 8 months ago
1993
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...