Sciweavers

492 search results - page 96 / 99
» Perfect Matching Preservers
Sort
View
ICALP
2010
Springer
15 years 4 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
15 years 4 months ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 3 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber
CIKM
2006
Springer
15 years 3 months ago
Structure-based querying of proteins using wavelets
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
Keith Marsolo, Srinivasan Parthasarathy, Kotagiri ...
FASE
2006
Springer
15 years 3 months ago
Trace-Based Memory Aliasing Across Program Versions
One of the major costs of software development is associated with testing and validation of successive versions of software systems. An important problem encountered in testing and...
Murali Krishna Ramanathan, Suresh Jagannathan, Ana...