Sciweavers

25 search results - page 5 / 5
» Query-Efficient Algorithms for Polynomial Interpolation over...
Sort
View
AAAI
2006
14 years 9 days ago
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
We consider the problem of rewriting a query efficiently using materialized views. In the context of information integration, this problem has received significant attention in th...
Yolifé Arvelo, Blai Bonet, Maria-Esther Vid...
ICSOC
2007
Springer
14 years 5 months ago
Execution Optimization for Composite Services Through Multiple Engines
Web services are rapidly emerging as a popular standard for sharing data and functionality among heterogeneous systems. We propose a general purpose Web Service Management System (...
Wubin Li, Zhuofeng Zhao, Jun Fang, Kun Chen
VIS
2004
IEEE
218views Visualization» more  VIS 2004»
15 years 3 days ago
Pixel-Exact Rendering of Spacetime Finite Element Solutions
Computational simulation of time-varying physical processes is of fundamental importance for many scientific and engineering applications. Most frequently, time-varying simulation...
Michael Garland, Robert Haber, Yuan Zhou
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 11 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
14 years 3 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain