2095 search results - page 310 / 419 » Improved pebbling bounds |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
SIGMOD
2007
ACM
14 years 10 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
EDBT
2004
ACM
14 years 10 months ago
2004
ACM
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...