7259 search results - page 1282 / 1452 » From Fields to Trees |
169
click to vote
ESA
1999
Springer
15 years 11 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
226
click to vote
VLDB
1999
ACM
15 years 10 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
182
click to vote
PVM
1997
Springer
15 years 10 months ago
1997
Springer
We present Ensemble, a message-passing implementation methodology, applied to PVM. Ensemble overcomes problems and complexities in developing applications in messagepassing enviro...
150
click to vote
DOCENG
2007
ACM
15 years 10 months ago
2007
ACM
Variable Data Printing (VDP) has brought new flexibility and dynamism to the printed page. Each printed instance of a specific class of document can now have different degrees of ...
192
click to vote
EMNLP
2007
15 years 8 months ago
2007
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...