Sciweavers

1300 search results - page 196 / 260
» cluster 2010
Sort
View
PPOPP
2010
ACM
16 years 3 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
WWW
2010
ACM
16 years 25 days ago
Relational duality: unsupervised extraction of semantic relations between entities on the web
Extracting semantic relations among entities is an important first step in various tasks in Web mining and natural language processing such as information extraction, relation de...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
16 years 21 days ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
CLOUD
2010
ACM
15 years 11 months ago
Comet: batched stream processing for data intensive distributed computing
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
Bingsheng He, Mao Yang, Zhenyu Guo, Rishan Chen, B...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 10 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...