Sciweavers

1362 search results - page 202 / 273
» Means, Correlations and Bounds
Sort
View
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 1 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
PODS
2003
ACM
135views Database» more  PODS 2003»
16 years 1 months ago
Query-preserving watermarking of relational databases and XML documents
Watermarking allows robust and unobtrusive insertion of information in a digital document. Very recently, techniques have been proposed for watermarking relational databases or XM...
David Gross-Amblard
ALT
2005
Springer
15 years 10 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
ICCAD
2006
IEEE
95views Hardware» more  ICCAD 2006»
15 years 10 months ago
Robust estimation of parametric yield under limited descriptions of uncertainty
Reliable prediction of parametric yield for a specific design is difficult; a significant reason is the reliance of the yield estimation methods on the hard-to-measure distributio...
Wei-Shen Wang, Michael Orshansky
STACS
2010
Springer
15 years 8 months ago
Unsatisfiable Linear CNF Formulas Are Large and Complex
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
Dominik Scheder