Sciweavers

2853 search results - page 57 / 571
» Finding related tables
Sort
View
WEBDB
2010
Springer
172views Database» more  WEBDB 2010»
14 years 3 months ago
Find your Advisor: Robust Knowledge Gathering from the Web
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
Ndapandula Nakashole, Martin Theobald, Gerhard Wei...
SODA
1993
ACM
119views Algorithms» more  SODA 1993»
13 years 11 months ago
Iterated Nearest Neighbors and Finding Minimal Polytopes
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
David Eppstein, Jeff Erickson
EDBT
2012
ACM
228views Database» more  EDBT 2012»
12 years 19 days ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
WISE
2009
Springer
14 years 7 months ago
Finding Comparative Facts and Aspects for Judging the Credibility of Uncertain Facts
Users often encounter unreliable information on the Web, but there is no system to check the credibility easily and efficiently. In this paper, we propose a system to search useful...
Yusuke Yamamoto, Katsumi Tanaka
P2P
2009
IEEE
114views Communications» more  P2P 2009»
14 years 5 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...