535 search results - page 59 / 107 » Generalized Version Space Trees |
106
click to vote
SPAA
2010
ACM
15 years 4 months ago
2010
ACM
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
146
click to vote
VLDB
2008
ACM
16 years 2 days ago
2008
ACM
Histograms are used to summarize the contents of relations into a number of buckets for the estimation of query result sizes. Several techniques (e.g., MaxDiff and V-Optimal) have ...
116
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
119
click to vote
FSTTCS
2008
Springer
15 years 28 days ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
104
click to vote
DDEP
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. Notations like SGML and XML represent document structures using tree structures; while this is in general a step forward from earlier systems, it creates certain difficul...