7228 search results - page 320 / 1446 » From Algorithmic to Subjective Randomness |
143
click to vote
DAGSTUHL
2004
15 years 6 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
152
Voted
COLOGNETWENTE
2009
15 years 6 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
159
click to vote
EMNLP
2010
15 years 2 months ago
2010
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
132
click to vote
STOC
1996
ACM
15 years 9 months ago
1996
ACM
In this paper we prove a perhaps unexpected relationship between the complexity class of the boolean functions that have linear size circuits, and n-party private protocols. Speci...
147
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
In this paper, we consider the topic of iterative, one dimensional, signal reconstruction (specifically speech signals) from the magnitude spectrum and the phase spectrum. While ...