903 search results - page 54 / 181 » On the reduction of a random basis |
168
click to vote
ICCPOL
2009
Springer
15 years 3 months ago
2009
Springer
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
183
click to vote
TDSC
2011
15 years 1 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...
168
click to vote
CCS
2006
ACM
15 years 10 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
176
click to vote
EMNLP
2006
15 years 7 months ago
2006
Markov order-1 conditional random fields (CRFs) and semi-Markov CRFs are two popular models for sequence segmentation and labeling. Both models have advantages in terms of the typ...
149
click to vote
JACM
2006
15 years 6 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...