5607 search results - page 946 / 1122 » Graph structure in the Web |
188
click to vote
CSL
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
137
click to vote
CGO
2006
IEEE
16 years 19 days ago
2006
IEEE
Explicit Data Graph Execution (EDGE) architectures offer the possibility of high instruction-level parallelism with energy efficiency. In EDGE architectures, the compiler breaks ...
196
click to vote
IWCMC
2006
ACM
16 years 15 days ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
191
click to vote
SIGECOM
2006
ACM
16 years 15 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
193
click to vote
INFOCOM
2005
IEEE
16 years 4 days ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...