Sciweavers

419 search results - page 58 / 84
» Improving Adaptable Similarity Query Processing by Using App...
Sort
View
147
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 5 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
COLING
2008
15 years 4 months ago
OntoNotes: Corpus Cleanup of Mistaken Agreement Using Word Sense Disambiguation
Annotated corpora are only useful if their annotations are consistent. Most large-scale annotation efforts take special measures to reconcile inter-annotator disagreement. To date...
Liang-Chih Yu, Chung-Hsien Wu, Eduard H. Hovy
TKDE
2008
121views more  TKDE 2008»
15 years 2 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
TPDS
2008
91views more  TPDS 2008»
15 years 2 months ago
SSW: A Small-World-Based Overlay for Peer-to-Peer Search
Peer-to-peer (P2P) systems have become a popular platform for sharing and exchanging voluminous information among thousands or even millions of users. The massive amount of inform...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam, Jin...
148
Voted
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
13 years 5 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray