Sciweavers

649 search results - page 61 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
LATIN
2010
Springer
16 years 1 months ago
Optimal Succinctness for Range Minimum Queries
For a static array A of n totally ordered objects, a range minimum query asks for the position of the minimum between two specified array indices. We show how to preprocess A into...
Johannes Fischer
EMNLP
2007
15 years 7 months ago
Bootstrapping Feature-Rich Dependency Parsers with Entropic Priors
One may need to build a statistical parser for a new language, using only a very small labeled treebank together with raw text. We argue that bootstrapping a parser is most promis...
David A. Smith, Jason Eisner
BMCBI
2008
153views more  BMCBI 2008»
15 years 6 months ago
How to make the most of NE dictionaries in statistical NER
Background: When term ambiguity and variability are very high, dictionary-based Named Entity Recognition (NER) is not an ideal solution even though large-scale terminological reso...
Yutaka Sasaki, Yoshimasa Tsuruoka, John McNaught, ...
BMCBI
2006
112views more  BMCBI 2006»
15 years 6 months ago
Protein disorder prediction by condensed PSSM considering propensity for order or disorder
Background: More and more disordered regions have been discovered in protein sequences, and many of them are found to be functionally significant. Previous studies reveal that dis...
Chung-Tsai Su, Chien-Yu Chen, Yu-Yen Ou
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
16 years 3 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu