11211 search results - page 113 / 2243 » Rank-Sensitive Data Structures |
112
Voted
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...
78
Voted
AAAI
2000
15 years 2 months ago
2000
The proliferation of online information sources has accentuated the need for tools that automatically validate and recognize data. We present an efficient algorithm that learns st...
110
click to vote
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
94
Voted
ICPR
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the...
97
Voted
NAACL
2001
15 years 2 months ago
2001
We present two methods for learning the structure of personal names from unlabeled data. The first simply uses a few implicit constraints governing this structure to gain a toehol...