14699 search results - page 276 / 2940 » Complexity and Cognitive Computing |
129
click to vote
CANDC
2000
ACM
15 years 4 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
162
click to vote
JMLR
2012
13 years 6 months ago
2012
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
131
click to vote
DCC
2006
IEEE
16 years 3 months ago
2006
IEEE
We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated...
159
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
123
click to vote
COMCOM
2004
15 years 4 months ago
2004
The Private Network-to-Network Interface (PNNI) is a scalable hierarchical protocol that allows ATM switches to be aggregated into clusters called peer groups. To provide good acc...