Sciweavers

2985 search results - page 252 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
15 years 10 months ago
Lower Bounds for Dynamic Algorithms
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
Michael L. Fredman
IPL
2006
103views more  IPL 2006»
15 years 6 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
ICDCSW
2006
IEEE
16 years 21 days ago
Automatic Subscriptions In Publish-Subscribe Systems
In this paper, we describe how to automate the process of subscribing to complex publish-subscribe systems. We present a proof-of-concept prototype, in which we analyze Web browsi...
Lars Brenna, Cathal Gurrin, Dag Johansen, Dmitrii ...
ICPPW
2003
IEEE
15 years 12 months ago
Security Aspects of Wireless Heterogeneous Databases - Protocol, Performance, and Energy Analysis
Users have been demanding information “anytime, anywhere”. The notion of accessing diverse and autonomous information repositories with different APIs is not accepted. This ha...
Harshal Haridas, Ali R. Hurson, Yu Jiao
166
Voted
STACS
2005
Springer
16 years 3 days ago
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
Nir Ailon, Bernard Chazelle