Sciweavers

1169 search results - page 84 / 234
» Degrees of monotone complexity
Sort
View
IPPS
1994
IEEE
14 years 3 months ago
AVL Trees with Relaxed Balance
AVL trees with relaxed balance were introduced with the aim of improving runtime performance by allowing a greater degree of concurrency. This is obtained by uncoupling updating f...
Kim S. Larsen
FSE
2000
Springer
96views Cryptology» more  FSE 2000»
14 years 2 months ago
On the Interpolation Attacks on Block Ciphers
Abstract. The complexity of interpolation attacks on block ciphers depends on the degree of the polynomial approximation and or on the number of terms in the polynomial approximati...
Amr M. Youssef, Guang Gong
HCI
2007
14 years 18 days ago
The Perceptual Eye View: A User-Defined Method for Information Visualization
With the growing volumes of data, exploring the relationships within the huge amounts of data is difficult. Information visualization uses the human perception system to assist use...
Liang-Hong Wu, Ping-Yu Hsu
MST
2010
111views more  MST 2010»
13 years 9 months ago
Sturmian Trees
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n + 1 distinct subtrees of height n for each n. As for the case of words,...
Jean Berstel, Luc Boasson, Olivier Carton, Isabell...
ICDE
2006
IEEE
147views Database» more  ICDE 2006»
14 years 5 months ago
Optimizing Multiple Queries in Distributed Data Stream Systems
We consider the problem of query optimization in distributed stream based systems where multiple continuous queries may be executing simultaneously. In such systems, distribution ...
Sangeetha Seshadri, Vibhore Kumar, Brian F. Cooper