2057 search results - page 326 / 412 » Scalable and Structured Scheduling |
119
Voted
KDD
2002
ACM
16 years 3 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
117
click to vote
OSDI
2006
ACM
16 years 3 months ago
2006
ACM
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay...
139
click to vote
ICALP
2009
Springer
16 years 3 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...
202
click to vote
SIGMOD
2008
ACM
16 years 3 months ago
2008
ACM
As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) ? t...
234
Voted
SIGMOD
2006
ACM
16 years 3 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...