Sciweavers

2031 search results - page 119 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
AAAI
2008
15 years 8 days ago
Extracting Relevant Snippets for Web Navigation
Search engines present fix-length passages from documents ranked by relevance against the query. In this paper, we present and compare novel, language-model based methods for extr...
Qing Li, K. Selçuk Candan, Qi Yan
BMCBI
2008
158views more  BMCBI 2008»
14 years 10 months ago
Discovering gene annotations in biomedical text databases
Currently, most of the discovered biological and biomedical knowledge is available as textual data in scientific papers. And, locating and curating information about a genomic enti...
Ali Cakmak, Gultekin Özsoyoglu
CORR
2010
Springer
111views Education» more  CORR 2010»
14 years 10 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
JSC
2010
103views more  JSC 2010»
14 years 8 months ago
Anti-patterns for rule-based languages
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally ...
Horatiu Cirstea, Claude Kirchner, Radu Kopetz, Pie...
STACS
2012
Springer
13 years 5 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen