Sciweavers

5606 search results - page 270 / 1122
» Randomization Techniques for Graphs.
Sort
View
MICCAI
2009
Springer
16 years 7 months ago
A Fully Automatic Random Walker Segmentation for Skin Lesions in a Supervised Setting
Abstract. We present a method for automatically segmenting skin lesions by initializing the random walker algorithm with seed points whose properties, such as colour and texture, h...
Paul Wighton, Maryam Sadeghi, Tim K. Lee, M. St...
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
15 years 12 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
CP
2000
Springer
15 years 10 months ago
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
This paper addresses the interaction between randomization, with restart strategies, and learning, an often crucial technique for proving unsatisfiability. We use instances of SAT ...
Luís Baptista, João P. Marques Silva
AIPS
2004
15 years 8 months ago
Learning Domain-Specific Control Knowledge from Random Walks
We describe and evaluate a system for learning domainspecific control knowledge. In particular, given a planning domain, the goal is to output a control policy that performs well ...
Alan Fern, Sung Wook Yoon, Robert Givan
EUROCRYPT
2012
Springer
13 years 9 months ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...