Sciweavers

1007 search results - page 103 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
110
Voted
MST
2000
57views more  MST 2000»
15 years 2 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
206
Voted
EDBT
2011
ACM
281views Database» more  EDBT 2011»
14 years 6 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo
134
Voted
ICIP
2010
IEEE
15 years 22 days ago
Dynamic selection of a feature-rich query frame for mobile video retrieval
In this paper, we focus on a new application of mobile visual search: snapping a photo with a mobile device of a video playing on a TV screen to automatically retrieve and stream ...
David M. Chen, Ngai-Man Cheung, Sam S. Tsai, Vijay...
134
Voted
WEBI
2007
Springer
15 years 8 months ago
Improving Performance of Web Services Query Matchmaking with Automated Knowledge Acquisition
There is a critical need to design and develop tools tract away the fundamental complexity of XML-based Web services specifications and toolkits, and provide an elegant, intuitive...
Chaitali Gupta, Rajdeep Bhowmik, Michael R. Head, ...
135
Voted
SIGMOD
2011
ACM
210views Database» more  SIGMOD 2011»
14 years 5 months ago
A platform for scalable one-pass analytics using MapReduce
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
Boduo Li, Edward Mazur, Yanlei Diao, Andrew McGreg...