Institution
Bar-Ilan University
Education•Ramat Gan, Israel•
About: Bar-Ilan University is a education organization based out in Ramat Gan, Israel. It is known for research contribution in the topics: Population & Poison control. The organization has 12835 authors who have published 34964 publications receiving 995648 citations. The organization is also known as: Bar Ilan University & BIU.
Papers published on a yearly basis
Papers
More filters
••
01 Feb 2000TL;DR: This work presents an algorithm that is faster than both the Galil-Giancarlo and Abrahamson algorithms in finding all locations where the pattern has at most k errors in time O(n√k log k).
Abstract: The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the text T. Currently, the fastest algorithms for this problem are the following. The Galil-Giancarlo algorithm finds all locations where the pattern has at most k errors (where k is part of the input) in time O(nk). The Abrahamson algorithm finds the number of mismatches at every location in time O(n√ m log m). We present an algorithm that is faster than both. Our algorithm finds all locations where the pattern has at most k errors in time O(n√k log k). We also show an algorithm that solves the above problem in time O((n + (nk3)/m) log k).
221 citations
••
221 citations
••
TL;DR: In this paper, the fabrication of a new bilayer TiO2/Nb2O5 nanoporous electrode that improved the performance of dye sensitized solar cells by more than 35% is reported.
221 citations
••
TL;DR: This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics and shows that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete.
Abstract: Temporal events are regarded here as intervals on a time line. This paper deals with problems in reasoning about such intervals when the precise topological relationship between them is unknown or only partially specified. This work unifies notions of interval algebras in artificial intelligence with those of interval orders and interval graphs in combinatorics. The satisfiability, minimal labeling, all solutions, and all realizations problems are considered for temporal (internal) data. Several versions are investigated by restricting the possible interval relationships yielding different complexity results. We show that even when the temporal data comprises of subsets of relations based on intersection and precedence only, the satisfiability question is NP-complete
221 citations
••
TL;DR: This special issue of the JNLE provides an opportunity to showcase some of the most important work in this emerging area of textual entailment, particularly automatic acquisition of paraphrases and lexical semantic relationships and unsupervised inference in applications such as question answering, information extraction and summarization.
Abstract: The goal of identifying textual entailment – whether one piece of text can be plausibly inferred from another – has emerged in recent years as a generic core problem in natural language understanding. Work in this area has been largely driven by the PASCAL Recognizing Textual Entailment (RTE) challenges, which are a series of annual competitive meetings. The current work exhibits strong ties to some earlier lines of research, particularly automatic acquisition of paraphrases and lexical semantic relationships and unsupervised inference in applications such as question answering, information extraction and summarization. It has also opened the way to newer lines of research on more involved inference methods, on knowledge representations needed to support this natural language understanding challenge and on the use of learning methods in this context. RTE has fostered an active and growing community of researchers focused on the problem of applied entailment. This special issue of the JNLE provides an opportunity to showcase some of the most important work in this emerging area.
221 citations
Authors
Showing all 13037 results
Name | H-index | Papers | Citations |
---|---|---|---|
H. Eugene Stanley | 154 | 1190 | 122321 |
Albert-László Barabási | 152 | 438 | 200119 |
Shlomo Havlin | 131 | 1013 | 83347 |
Stuart A. Aaronson | 129 | 657 | 69633 |
Britton Chance | 128 | 1112 | 76591 |
Mark A. Ratner | 127 | 968 | 68132 |
Doron Aurbach | 126 | 797 | 69313 |
Jun Yu | 121 | 1174 | 81186 |
Richard J. Wurtman | 114 | 933 | 53290 |
Amir Lerman | 111 | 877 | 51969 |
Zhu Han | 109 | 1407 | 48725 |
Moussa B.H. Youdim | 107 | 574 | 42538 |
Juan Bisquert | 107 | 450 | 46267 |
Rachel Yehuda | 106 | 461 | 36726 |
Michael F. Green | 106 | 485 | 45707 |