Sciweavers

953 search results - page 182 / 191
» A note on the paper
Sort
View
ECCC
2006
88views more  ECCC 2006»
13 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
ENTCS
2006
128views more  ENTCS 2006»
13 years 7 months ago
Web Verification: Perspective and Challenges
The Web poses novel and interesting problems for both programming language design and verification--and their intersection. This paper provides a personal outline of one thread of...
Shriram Krishnamurthi
IJISEC
2008
69views more  IJISEC 2008»
13 years 7 months ago
A survey of certificateless encryption schemes and security models
Abstract This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the...
Alexander W. Dent
IANDC
2006
121views more  IANDC 2006»
13 years 7 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
IEICET
2006
79views more  IEICET 2006»
13 years 7 months ago
System LSI: Challenges and Opportunities
End of CMOS scaling has been discussed in many places since the late 90's. Even if the end of CMOS scaling is irrelevant, it is for sure that we are facing a turning point in...
Tadahiro Kuroda