Sciweavers

4112 search results - page 663 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ACL
2010
15 years 2 months ago
Structural Semantic Relatedness: A Knowledge-Based Method to Named Entity Disambiguation
Name ambiguity problem has raised urgent demands for efficient, high-quality named entity disambiguation methods. In recent years, the increasing availability of large-scale, rich...
Xianpei Han, Jun Zhao
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
15 years 2 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
IEAAIE
2009
Springer
15 years 11 months ago
Incremental Mining of Ontological Association Rules in Evolving Environments
The process of knowledge discovery from databases is a knowledge intensive, highly user-oriented practice, thus has recently heralded the development of ontology-incorporated data ...
Ming-Cheng Tseng, Wen-Yang Lin
SAS
1994
Springer
159views Formal Methods» more  SAS 1994»
15 years 8 months ago
Iterative Fixed Point Computation for Type-Based Strictness Analysis
Amtoft has formulated an "on-line" constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normaliz...
Fritz Henglein
CIKM
2008
Springer
15 years 6 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu