Sciweavers

18306 search results - page 31 / 3662
» Algorithmics in Exponential Time
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
COLOGNETWENTE
2010
13 years 6 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
EATIS
2007
ACM
13 years 11 months ago
A method using time series analysis for IEEE 802.11 WLANs channel forecasting
Abstract-- The growth of wireless network use has greatly increased research demand. Some applications, which are contextaware, must adapt to the environment. So, information on bo...
Jeandro Bezerra, Rudy Braquehais, Filipe Roberto, ...
PRICAI
2004
Springer
14 years 1 months ago
An Anytime Algorithm for Interpreting Arguments
Abstract. The problem of interpreting Natural Language (NL) discourse is generally of exponential complexity. However, since interactions with users must be conducted in real time,...
Sarah George, Ingrid Zukerman, Michael Niemann
SACRYPT
2001
Springer
130views Cryptology» more  SACRYPT 2001»
14 years 4 days ago
Algorithms for Multi-exponentiation
This paper compares different approaches for computing power products 1≤i≤k gei i in finite groups. We look at the conventional simultaneous exponentiation approach and prese...
Bodo Möller