440 search results - page 76 / 88 » On partial randomness |
SAT
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
ICPR
2004
IEEE
16 years 24 days ago
2004
IEEE
Authors Address the problem of recognition and retrieval of relatively weak industrial signal such as Partial Discharges (PD) buried in excessive noise. The major bottleneck being...
WWW
2007
ACM
16 years 11 days ago
2007
ACM
Often scientists seek to search for articles on the Web related to a particular chemical. When a scientist searches for a chemical formula using a search engine today, she gets ar...
97
Voted
TCC
2009
Springer
16 years 7 days ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
108
click to vote
KDD
2008
ACM
16 years 3 days ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...