Sciweavers

274 search results - page 13 / 55
» Computational complexity of queries based on itemsets
Sort
View
98
Voted
CVPR
1997
IEEE
15 years 4 months ago
FOCUS: Searching for Multi-colored Objects in a Diverse Image Database
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System, with an online user interface which is capable of identifying mult...
Madirakshi Das, Edward M. Riseman, Bruce A. Draper
PARLE
1992
15 years 4 months ago
Performance Evaluation of Parallel Transaction Processing in Shared Nothing Database Systems
Complex and data-intensive database queries mandate parallel processing strategies to achieve sufficiently short response times. In praxis, parallel database processing is mostly b...
Robert Marek, Erhard Rahm
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
13 years 2 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
129
Voted
ICDCS
1999
IEEE
15 years 4 months ago
Run-time Detection in Parallel and Distributed Systems: Application to Safety-Critical Systems
There is growing interest in run-time detection as parallel and distributed systems grow larger and more complex. This work targets run-time analysis of complex, interactive scien...
Beth Plale, Karsten Schwan
94
Voted
WWW
2007
ACM
16 years 1 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li