Sciweavers

29908 search results - page 157 / 5982
» On the complexity of communication complexity
Sort
View
AICT
2006
IEEE
128views Communications» more  AICT 2006»
16 years 16 days ago
Duality in Web Services Reliability
The Web services technology allows for easy creation of complex applications consisting of smaller components - Web services. This article performs an in-depth analysis of a Web s...
Witold Abramowicz, Monika Kaczmarek, Dominik Zysko...
ICCNMC
2005
Springer
15 years 12 months ago
Data Structure Optimization of AS_PATH in BGP
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...
Weirong Jiang
MFCS
2004
Springer
15 years 11 months ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 10 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson
ITA
2008
119views Communications» more  ITA 2008»
15 years 6 months ago
Some Algebraic Properties of Machine Poset of Infinite Words
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
Aleksandrs Belovs