22128 search results - page 4328 / 4426 » Research in Structural Computing |
122
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
229
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
214
click to vote
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
196
Voted
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
230
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...