Sciweavers

1548 search results - page 39 / 310
» Computational Approaches to Sentence Completion
Sort
View
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 6 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
ICNSC
2007
IEEE
16 years 17 days ago
A novel approach for Self-Localization based on Computer Vision and Artificial Marker Deposition
— A new velocity and position sensor concept for manned and unmanned ground vehicles is proposed. The idea of this system is to temporarily place artificial markers in the enviro...
Savan Chhaniyara, Kaspar Althoefer, Yahya H. Zweir...
ACL
2006
15 years 7 months ago
An All-Subtrees Approach to Unsupervised Parsing
We investigate generalizations of the allsubtrees "DOP" approach to unsupervised parsing. Unsupervised DOP models assign all possible binary trees to a set of sentences ...
Rens Bod
ACL
2012
13 years 8 months ago
Robust Conversion of CCG Derivations to Phrase Structure Trees
We propose an improved, bottom-up method for converting CCG derivations into PTB-style phrase structure trees. In contrast with past work (Clark and Curran, 2009), which used simp...
Jonathan K. Kummerfeld, Dan Klein, James R. Curran
STACS
1998
Springer
15 years 10 months ago
Random Sparse Bit Strings at the Threshold of Adjacency
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
Joel Spencer, Katherine St. John