Sciweavers

2635 search results - page 127 / 527
» Algorithms for the Database Layout Problem
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 4 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
JEA
2006
83views more  JEA 2006»
15 years 4 months ago
Cache-Friendly implementations of transitive closure
In this paper we show cache-friendly implementations of the Floyd-Warshall algorithm for the All-Pairs ShortestPath problem. We first compare the best commercial compiler optimiza...
Michael Penner, Viktor K. Prasanna
IJCV
2011
152views more  IJCV 2011»
14 years 11 months ago
Recovering Occlusion Boundaries from an Image
Occlusion reasoning is a fundamental problem in computer vision. In this paper, we propose an algorithm to recover the occlusion boundaries and depth ordering of free-standing str...
Derek Hoiem, Alexei A. Efros, Martial Hebert
ICDT
2003
ACM
91views Database» more  ICDT 2003»
15 years 9 months ago
Reformulation of XML Queries and Constraints
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
Alin Deutsch, Val Tannen
EDBT
2004
ACM
110views Database» more  EDBT 2004»
16 years 4 months ago
Using Convolution to Mine Obscure Periodic Patterns in One Pass
The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior o...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...