Sciweavers

1778 search results - page 74 / 356
» On the Power of the Randomized Iterate
Sort
View
FOCS
1994
IEEE
15 years 10 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
ICASSP
2011
IEEE
14 years 10 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
AAAI
1998
15 years 7 months ago
Experimenting with Power Default Reasoning
In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR),a form of non-monotonicreasoning whichthe underlyinglogic is Kleene's3-valued p...
Eric Klavins, William C. Rounds, Guo-Qiang Zhang
SIAMAM
2008
84views more  SIAMAM 2008»
15 years 6 months ago
Effective Transport Equations and Enhanced Backscattering in Random Waveguides
In this paper we derive a general system of transport equations for the moments of reflected and transmitted mode amplitudes in a randomly perturbed waveguide, in a regime where ba...
Josselin Garnier, Knut Sølna
CSFW
2010
IEEE
15 years 10 months ago
On Protection by Layout Randomization
Abstract—Layout randomization is a powerful, popular technique for software protection. We present it and study it in programming-language terms. More specifically, we consider ...
Martín Abadi, Gordon D. Plotkin