Sciweavers

3378 search results - page 554 / 676
» A universe of binding and computation
Sort
View
JCS
2008
109views more  JCS 2008»
14 years 10 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
JUCS
2008
144views more  JUCS 2008»
14 years 10 months ago
Applications of Mash-ups for a Digital Journal
: The WWW is currently experiencing a revolutionary growth due to numerous emerging tools, techniques and concepts. Digital journals thus need to transform themselves to cope with ...
Muhammad Salman Khan, Narayanan Kulathuramaiyer, H...
ENTCS
2007
121views more  ENTCS 2007»
14 years 10 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
MP
2008
135views more  MP 2008»
14 years 10 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
EOR
2007
96views more  EOR 2007»
14 years 10 months ago
A fast method for discovering critical edge sequences in e-commerce catalogs
Web sites allow the collection of vast amounts of navigational data – clickstreams of user traversals through the site. These massive data stores offer the tantalizing possibil...
Kaushik Dutta, Debra E. VanderMeer, Anindya Datta,...