4850 search results - page 389 / 970 » Approximate Data Structures with Applications |
176
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
199
click to vote
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Semistructured databases are treated as dynamically typed: they come equipped with no independent schema or type system to constrain the data. Query languages that are designed fo...
196
click to vote
ANLP
2000
15 years 8 months ago
2000
This paper describes an approach to providing lexical information for natural language processing in unrestricted domains. A system of approximately 1200 morphological rules is us...
204
click to vote
JCDL
2006
ACM
16 years 24 days ago
2006
ACM
In this paper we present a method of parsing unstructured textual records briefly describing a person and their direct relatives, which we use in the construction of a browsing t...
204
click to vote
XSYM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...