Sciweavers

971 search results - page 111 / 195
» Approximate Satisfiability and Equivalence
Sort
View
119
Voted
NETWORKS
2007
15 years 8 days ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
FMSD
2010
123views more  FMSD 2010»
14 years 11 months ago
Analog property checkers: a DDR2 case study
Abstract Modeling and Simulation Aided Verification of Analog/MixedSignal Circuits S. Little and C. Myers (University of Utah, USA) Monday, July 14, 14:00-17:00 4 14:00-14:40 fSpic...
Kevin D. Jones, Victor Konrad, Dejan Nickovic
96
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
70
Voted
SIAMSC
2010
119views more  SIAMSC 2010»
14 years 11 months ago
An Entropy Adjoint Approach to Mesh Refinement
This work presents a mesh refinement indicator based on entropy variables, with an application to the compressible Navier-Stokes equations. The entropy variables are shown to sati...
Krzysztof J. Fidkowski, Philip L. Roe
116
Voted
WOTE
2010
14 years 10 months ago
Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
Abstract. While electronic elections promise the possibility of convenient, efficient and secure facilities for recording and tallying votes, recent studies have highlighted inadeq...
Stéphanie Delaune, Steve Kremer, Mark Ryan