3396 search results - page 504 / 680 » Tree representations of graphs |
128
click to vote
FCCM
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper presents a method, called multiple constant multiplier trees MCMTs, for producing optimized recon gurable hardware implementations of vector products. An algorithm for ...
143
click to vote
DCC
1996
IEEE
15 years 10 months ago
1996
IEEE
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
133
click to vote
LREC
2010
15 years 7 months ago
2010
Meanings of morphological categories are an indispensable component of representation of sentence semantics. In the Prague Dependency Treebank 2.0, sentence semantics is represent...
178
Voted
NIPS
2008
15 years 7 months ago
2008
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
148
click to vote
ACL
2004
15 years 7 months ago
2004
This paper shows how finite approximations of long distance dependency (LDD) resolution can be obtained automatically for wide-coverage, robust, probabilistic Lexical-Functional G...