2661 search results - page 472 / 533 » Quantum Complexity Classes |
122
Voted
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
105
Voted
JISBD
2001
15 years 2 months ago
2001
Existing tools intended to build and deploy engaging complex Web sites (including functionality) have shown to be inadequate to face the software production process in an unified a...
140
click to vote
NIPS
2001
15 years 2 months ago
2001
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
114
click to vote
SBBD
2004
15 years 2 months ago
2004
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
117
Voted
DAGSTUHL
1996
15 years 2 months ago
1996
As partial evaluation gets more mature, it is now possible to use this program transformation technique to tackle realistic languages and real-size application programs. However, t...