Sciweavers

461 search results - page 37 / 93
» Splitting NP-Complete Sets
Sort
View
INTERSPEECH
2010
13 years 5 months ago
Semi-supervised extractive speech summarization via co-training algorithm
Supervised methods for extractive speech summarization require a large training set. Summary annotation is often expensive and time consuming. In this paper, we exploit semisuperv...
Shasha Xie, Hui Lin, Yang Liu
CICLING
2009
Springer
13 years 8 months ago
NLP for Shallow Question Answering of Legal Documents Using Graphs
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
Alfredo Monroy, Hiram Calvo, Alexander F. Gelbukh
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 2 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
PLDI
2011
ACM
13 years 1 months ago
Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors
MATLAB is an array language, initially popular for rapid prototyping, but is now being increasingly used to develop production code for numerical and scientific applications. Typ...
Ashwin Prasad, Jayvant Anantpur, R. Govindarajan
EDBT
2004
ACM
131views Database» more  EDBT 2004»
14 years 11 months ago
A Framework for Access Methods for Versioned Data
This paper presents a framework for understanding and constructing access methods for versioned data. Records are associated with version ranges in a version tree. A minimal repre...
Betty Salzberg, Linan Jiang, David B. Lomet, Manue...