Sciweavers

524 search results - page 70 / 105
» ets 2010
Sort
View
SOFSEM
2010
Springer
14 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
TCC
2010
Springer
179views Cryptology» more  TCC 2010»
14 years 4 months ago
Private Coins versus Public Coins in Zero-Knowledge Proof Systems
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...
Rafael Pass, Muthuramakrishnan Venkitasubramaniam
CVPR
2010
IEEE
14 years 4 months ago
Fast Global Optimization of Curvature
Two challenges in computer vision are to accommodate noisy data and missing data. Many problems in computer vision, such as segmentation, filtering, stereo, reconstruction, inpain...
Noha El-Zehiry, Leo Grady
STACS
2010
Springer
14 years 2 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
SAC
2010
ACM
14 years 2 months ago
Ontology-based generation of IT-security metrics
Legal regulations and industry standards require organizations to measure and maintain a specified IT-security level. Although several IT-security metrics approaches have been de...
Stefan Fenz