Sciweavers

3368 search results - page 179 / 674
» The Complexity of Query Reliability
Sort
View
152
Voted
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
15 years 11 days ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande
139
Voted
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 6 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
127
Voted
CIKM
2011
Springer
14 years 2 months ago
Ranking-based processing of SQL queries
A growing number of applications are built on top of search engines and issue complex structured queries. This paper contributes a customisable ranking-based processing of such qu...
Hany Azzam, Thomas Roelleke, Sirvan Yahyaei
137
Voted
ICPR
2004
IEEE
16 years 3 months ago
A Consistency-Based Model Selection for One-Class Classification
Model selection in unsupervised learning is a hard problem. In this paper a simple selection criterion for hyperparameters in one-class classifiers (OCCs) is proposed. It makes us...
David M. J. Tax, Klaus-Robert Müller
97
Voted
PPL
2010
118views more  PPL 2010»
15 years 1 months ago
Coping with Decoherence: Parallelizing the Quantum Fourier Transform
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
Marius Nagy, Selim G. Akl