Sciweavers

884 search results - page 127 / 177
» A Proof Theory for DL-Lite
Sort
View
EGOV
2007
Springer
15 years 6 months ago
Towards a Methodology for Designing E-Government Control Procedures
The EU is currently modernizing customs legislation and practices. Main pillars in the new vision are an intensive use of IT (Customs becomes eCustoms), partnerships between Custom...
Ziv Baida, Jianwei Liu, Yao-Hua Tan
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
15 years 5 months ago
Braess's paradox in large random graphs
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
Gregory Valiant, Tim Roughgarden
LICS
2003
IEEE
15 years 5 months ago
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
Hubert Comon-Lundh, Vitaly Shmatikov
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
15 years 3 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
15 years 1 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau