Sciweavers

740 search results - page 73 / 148
» Recursive layout generation
Sort
View
JCT
2010
92views more  JCT 2010»
14 years 11 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
78
Voted
TCS
2010
14 years 11 months ago
Left-forbidding cooperating distributed grammar systems
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...
Filip Goldefus, Tomás Masopust, Alexander M...
100
Voted
ACL
2010
14 years 10 months ago
Bootstrapping Semantic Analyzers from Non-Contradictory Texts
We argue that groups of unannotated texts with overlapping and non-contradictory semantics represent a valuable source of information for learning semantic representations. A simp...
Ivan Titov, Mikhail Kozhevnikov
111
Voted
RECOMB
2001
Springer
16 years 27 days ago
A new approach to fragment assembly in DNA sequencing
For the last twenty years fragment assembly in DNA sequencing followed the "overlap - layout - consensus" paradigm that is used in all currently available assembly tools...
Pavel A. Pevzner, Haixu Tang, Michael S. Waterman
116
Voted
SEMWEB
2009
Springer
15 years 7 months ago
XLWrap - Querying and Integrating Arbitrary Spreadsheets with SPARQL
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
Andreas Langegger, Wolfram Wöß