Sciweavers

1038 search results - page 105 / 208
» Space-Bounded Query Approximation
Sort
View
CIKM
2009
Springer
15 years 7 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
15 years 4 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
JC
2007
94views more  JC 2007»
15 years 4 months ago
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
A. Papageorgiou
JSS
2010
208views more  JSS 2010»
15 years 2 months ago
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
This paper investigates a class of mobile wireless sensor networks that are unconnected most of the times; we refer to them as delay–tolerant wireless sensor networks (DTWSN). T...
Abbas Nayebi, Hamid Sarbazi-Azad, Gunnar Karlsson
SIGMOD
2005
ACM
107views Database» more  SIGMOD 2005»
16 years 4 months ago
Relational Confidence Bounds Are Easy With The Bootstrap
Statistical estimation and approximate query processing have become increasingly prevalent applications for database systems. However, approximation is usually of little use witho...
Abhijit Pol, Chris Jermaine