Sciweavers

264 search results - page 10 / 53
» First order LUB approximations: characterization and algorit...
Sort
View
ICML
2009
IEEE
16 years 14 days ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
61
Voted
ACL
2004
15 years 1 months ago
Computing Locally Coherent Discourses
We present the first algorithm that computes optimal orderings of sentences into a locally coherent discourse. The algorithm runs very efficiently on a variety of coherence measur...
Ernst Althaus, Nikiforos Karamanis, Alexander Koll...
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 1 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
JDCTA
2010
150views more  JDCTA 2010»
14 years 6 months ago
Ignition Coil Insulation Fault Detection Algorithm
Pulse singularities with variable amplitudes appear in the corresponding positions of ignition coil primary current waveform when insulation fault occurs during the ignition proce...
Mutian Li, Yongping Zhao, Qisong Wang
STOC
2009
ACM
271views Algorithms» more  STOC 2009»
16 years 8 days ago
A fast and efficient algorithm for low-rank approximation of a matrix
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
Nam H. Nguyen, Thong T. Do, Trac D. Tran