Sciweavers

1945 search results - page 295 / 389
» Survivable Information Storage Systems
Sort
View
EDBT
2010
ACM
144views Database» more  EDBT 2010»
14 years 1 months ago
Timely YAGO: harvesting, querying, and visualizing temporal knowledge from Wikipedia
Recent progress in information extraction has shown how to automatically build large ontologies from high-quality sources like Wikipedia. But knowledge evolves over time; facts ha...
Yafang Wang, Mingjie Zhu, Lizhen Qu, Marc Spaniol,...
JCDL
2010
ACM
150views Education» more  JCDL 2010»
14 years 1 days ago
Interpretation of web page layouts by blind users
Digital libraries must support assistive technologies that allow people with disabilities such as blindness to use, navigate and understand their documents. Increasingly, many doc...
Luis Francisco-Revilla, Jeff Crow
COMPGEOM
2005
ACM
14 years 18 hour ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
DMSN
2005
ACM
14 years 13 hour ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
DOLAP
2005
ACM
14 years 12 hour ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea