47 search results - page 7 / 10 » An Algorithm for VP Ellipsis |
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper we consider the optimization of transceivers which use the nonlinear vector perturbation technique at the transmitter. Since the perturbation vector can be almost...
ANLP
2000
13 years 8 months ago
2000
It is generally recognized that the common nonterminal labels for syntactic constituents (NP, VP, etc.) do not exhaust the syntactic and semantic information one would like about ...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
In this paper we present a simple to implement truly online large margin version of the Perceptron ranking (PRank) algorithm, called the OAP-BPM (Online Aggregate Prank-Bayes Poin...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...