Sciweavers

Share
AAAI
2011
8 years 8 months ago
Lossy Conservative Update (LCU) Sketch: Succinct Approximate Count Storage
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
Amit Goyal, Hal Daumé III
SIGMOD
2011
ACM
201views Database» more  SIGMOD 2011»
8 years 11 months ago
Apache hadoop goes realtime at Facebook
Facebook recently deployed Facebook Messages, its first ever user-facing application built on the Apache Hadoop platform. Apache HBase is a database-like layer built on Hadoop des...
Dhruba Borthakur, Jonathan Gray, Joydeep Sen Sarma...
AMT
2010
Springer
302views Multimedia» more  AMT 2010»
9 years 9 months ago
Social Relation Based Search Refinement: Let Your Friends Help You!
One of the major problems for search at Web scale is that the search results on the large scale data might be huge and the users have to browse to find the most relevant ones. Plus...
Xu Ren, Yi Zeng, Yulin Qin, Ning Zhong, Zhisheng H...
AMT
2009
Springer
116views Multimedia» more  AMT 2009»
10 years 2 months ago
Unifying Web-Scale Search and Reasoning from the Viewpoint of Granularity
Considering the time constraints and Web scale data, it is impossible to achieve absolutely complete reasoning results. Plus, the same results may not meet the diversity of user ne...
Yi Zeng, Yan Wang, Zhisheng Huang, Ning Zhong
AMT
2009
Springer
151views Multimedia» more  AMT 2009»
10 years 2 months ago
The Quest for Parallel Reasoning on the Semantic Web
Traditional reasoning tools for the Semantic Web cannot cope with Web scale data. One major direction to improve performance is parallelization. This article surveys existing studi...
Peiqiang Li, Yi Zeng, Spyros Kotoulas, Jacopo Urba...
books