Sciweavers

3652 search results - page 360 / 731
» A study of query length
Sort
View
IPM
2008
93views more  IPM 2008»
15 years 4 months ago
A new robust relevance model in the language model framework
ct 8 In this paper, a new robust relevance model is proposed that can be applied to both pseudo and true relevance feedback 9 in the language-modeling framework for document retrie...
Xiaoyan Li
ENGL
2007
87views more  ENGL 2007»
15 years 4 months ago
Learning of Partial Languages
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
K. Sasikala, V. Rajkumar Dare, D. G. Thomas
COLT
2010
Springer
15 years 2 months ago
Mansour's Conjecture is True for Random DNF Formulas
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
Adam R. Klivans, Homin K. Lee, Andrew Wan
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
15 years 5 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
BMCBI
2004
119views more  BMCBI 2004»
15 years 3 months ago
Identification of polymorphic tandem repeats by direct comparison of genome sequence from different bacterial strains : a web-ba
Background: Polymorphic tandem repeat typing is a new generic technology which has been proved to be very efficient for bacterial pathogens such as B. anthracis, M. tuberculosis, ...
France Denoeud, Gilles Vergnaud