Sciweavers

461 search results - page 85 / 93
» Fundamentals of concern manipulation
Sort
View
SIGMETRICS
2010
ACM
139views Hardware» more  SIGMETRICS 2010»
14 years 10 days ago
On the flow-level dynamics of a packet-switched network
: The packet is the fundamental unit of transportation in modern communication networks such as the Internet. Physical layer scheduling decisions are made at the level of packets, ...
Ciamac Cyrus Moallemi, Devavrat Shah
SIGMOD
2010
ACM
223views Database» more  SIGMOD 2010»
14 years 10 days ago
Finding maximal cliques in massive networks by H*-graph
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey X...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
14 years 1 days ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
LICS
2000
IEEE
13 years 12 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
DIALM
1999
ACM
150views Algorithms» more  DIALM 1999»
13 years 12 months ago
Mobile computing in next generation wireless networks
In this paper, we attempt to describe the evolving status of wireless communications and its impact on the future of mobile computing. We present a historical perspective and eluc...
Prathima Agrawal, David Famolari