Sciweavers

3208 search results - page 132 / 642
» A Lower Bound for Primality
Sort
View
PODS
2004
ACM
137views Database» more  PODS 2004»
16 years 6 months ago
On the Memory Requirements of XPath Evaluation over XML Streams
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
Ziv Bar-Yossef, Marcus Fontoura, Vanja Josifovski
ICALP
2001
Springer
15 years 11 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
AMC
2008
82views more  AMC 2008»
15 years 6 months ago
Parameter estimation error bounds for Hammerstein nonlinear finite impulsive response models
This paper presents a parameter estimation algorithm for a class of Hammerstein nonlinear systems
Li Yu, Jiabo Zhang, Yuwu Liao, Jie Ding
DM
2006
70views more  DM 2006»
15 years 6 months ago
Improving probability bounds by optimization over subsets
The simple device of maximization over subsets of events can provide substantial improvement over the Dawson
Fred M. Hoppe