Sciweavers

114 search results - page 17 / 23
» Engineering Algorithms for Approximate Weighted Matching
Sort
View
FSTTCS
2000
Springer
15 years 5 months ago
On-Line Edge-Coloring with a Fixed Number of Colors
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
Lene M. Favrholdt, Morten N. Nielsen
JDCTA
2010
152views more  JDCTA 2010»
14 years 8 months ago
A Semantic Approach to Extract the Final Answer in SBUQA Question Answering System
In this paper we introduce the semantic approach of the answer extraction component of a question answering system called SBUQA. The answer extraction component gets the retrieved...
Mehrnoush Shamsfard, Mahsa Arab Yarmohammadi
117
Voted
WWW
2007
ACM
16 years 2 months ago
Answering relationship queries on the web
Finding relationships between entities on the Web, e.g., the connections between different places or the commonalities of people, is a novel and challenging problem. Existing Web ...
Gang Luo, Chunqiang Tang, Ying-li Tian
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
15 years 3 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
FSTTCS
2010
Springer
14 years 11 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang