Sciweavers

1007 search results - page 85 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
PDPTA
2010
15 years 26 days ago
A Novel Computation-to-core Mapping Scheme for Robust Facet Image Modeling on GPUs
Though the GPGPU concept is well-known in image processing, much more work remains to be done to fully exploit GPUs as an alternative computation engine. The difficulty is not refo...
Seung In Park, Yong Cao, Layne T. Watson
ICDCS
1996
IEEE
15 years 7 months ago
How to Recover Efficiently and Asynchronously when Optimism Fails
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...
Om P. Damani, Vijay K. Garg
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
14 years 5 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
MVA
1994
113views Computer Vision» more  MVA 1994»
15 years 4 months ago
A Modified Simulation Environment for Reconfigurable Multicomputer Systems in Digital Image Processing Applications
In our work we improve the EPPI programming environment, which was made in the University of Castilla - la Mancha one year ago. EPPI is a tool for simulating parallel algorithms t...
Francisco J. Quiles, Antonio Jose Garrido del Solo
CIKM
2006
Springer
15 years 6 months ago
Maximizing the sustained throughput of distributed continuous queries
Monitoring systems today often involve continuous queries over streaming data, in a distributed collaborative system. The distribution of query operators over a network of process...
Ioana Stanoi, George A. Mihaila, Themis Palpanas, ...