Sciweavers

1672 search results - page 291 / 335
» Tightness problems in the plane
Sort
View
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
14 years 1 months ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
CRYPTO
2008
Springer
84views Cryptology» more  CRYPTO 2008»
13 years 10 months ago
Improved Bounds on Security Reductions for Discrete Log Based Signatures
Despite considerable research efforts, no efficient reduction from the discrete log problem to forging a discrete log based signature (e.g. Schnorr) is currently known. In fact, ne...
Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Loka...
DBA
2006
236views Database» more  DBA 2006»
13 years 10 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
BMCBI
2006
138views more  BMCBI 2006»
13 years 8 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
IANDC
2008
105views more  IANDC 2008»
13 years 8 months ago
Symbolic protocol analysis for monoidal equational theories
We are interested in the design of automated procedures for analyzing the (in)security of cryptographic protocols in the Dolev-Yao model for a bounded number of sessions when we t...
Stéphanie Delaune, Pascal Lafourcade, Denis...