Sciweavers

6833 search results - page 156 / 1367
» Some two-character sets
Sort
View
SOFSEM
2012
Springer
14 years 1 months ago
Iterated Hairpin Completions of Non-crossing Words
Abstract. Iterated hairpin completion is an operation on formal languages that is inspired by the hairpin formation in DNA biochemistry. Iterated hairpin completion of a word (or m...
Lila Kari, Steffen Kopecki, Shinnosuke Seki
ACL
2012
13 years 8 months ago
Concept-to-text Generation via Discriminative Reranking
This paper proposes a data-driven method for concept-to-text generation, the task of automatically producing textual output from non-linguistic input. A key insight in our approac...
Ioannis Konstas, Mirella Lapata
AAAI
2012
13 years 8 months ago
Colorization by Matrix Completion
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
Shusen Wang, Zhihua Zhang
CSR
2007
Springer
16 years 10 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
KDD
1999
ACM
199views Data Mining» more  KDD 1999»
15 years 10 months ago
The Application of AdaBoost for Distributed, Scalable and On-Line Learning
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang