Sciweavers

10792 search results - page 28 / 2159
» An Evaluation of Non-Equijoin Algorithms
Sort
View
GROUP
2010
ACM
13 years 7 months ago
Design, implementation, and evaluation of an approach for determining when programmers are having difficulty
Previous research has motivated the idea of automatically determining when programmers are having difficulty, provided an initial algorithm (unimplemented in an actual system), an...
Jason Carter, Prasun Dewan
PVLDB
2010
85views more  PVLDB 2010»
13 years 8 months ago
Evaluating Entity Resolution Results
Entity Resolution (ER) is the process of identifying groups of records that refer to the same real-world entity. Various measures (e.g., pairwise F1, cluster F1) have been used fo...
David Menestrina, Steven Whang, Hector Garcia-Moli...
TKDE
2010
153views more  TKDE 2010»
13 years 8 months ago
Automatic Ontology Matching via Upper Ontologies: A Systematic Evaluation
—“Ontology matching” is the process of finding correspondences between entities belonging to different ontologies. This paper describes a set of algorithms that exploit uppe...
Viviana Mascardi, Angela Locoro, Paolo Rosso
EACL
2010
ACL Anthology
13 years 7 months ago
Generating Referring Expressions in Context: The GREC Task Evaluation Challenges
Until recently, referring expression generation (reg) research focused on the task of selecting the semantic content of definite mentions of listener-familiar discourse entities. I...
Anja Belz, Eric Kow, Jette Viethen, Albert Gatt
IR
2010
13 years 7 months ago
Efficient algorithms for ranking with SVMs
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
Olivier Chapelle, S. Sathiya Keerthi