Sciweavers

4411 search results - page 221 / 883
» Communication Complexity and Its Applications
Sort
View
AISC
2006
Springer
15 years 9 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey
COLING
1990
15 years 6 months ago
A Formal Description of Arabic Syntax in Definite Clause Grammar
Arabic has some special syntax features which lead to complex syntax structures. We have developed a formal description of Arabic syntax in Definite Clause Grammar. This grarnrnar...
Hisham El-Shishiny
BXML
2004
15 years 7 months ago
Using semantic Web services for ad hoc collaboration in virtual teams
: The system presented in this paper shows an alternative solution for the communication problem in virtual teams. Although it does not address the full bandwidth of tasks of an gr...
Matthias Flügge, Kay-Uwe Schmidt
149
Voted
SIGCOMM
2006
ACM
15 years 11 months ago
Building an AS-topology model that captures route diversity
An understanding of the topological structure of the Internet is needed for quite a number of networking tasks, e.g., making decisions about peering relationships, choice of upstr...
Wolfgang Mühlbauer, Anja Feldmann, Olaf Maenn...
NETGAMES
2003
ACM
15 years 10 months ago
Mobility and stability evaluation in wireless multi-hop networks using multi-player games
Plenty of work was contributed in the field of protocol design and performance evaluation of multi-hop networks. It is generally accepted that mobility has a huge impact on the p...
Frank H. P. Fitzek, Leonardo Badia, Michele Zorzi,...