Sciweavers

5153 search results - page 192 / 1031
» Introduction to Randomized Algorithms
Sort
View
145
Voted
ICML
2001
IEEE
16 years 4 months ago
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
We present conditional random fields, a framework for building probabilistic models to segment and label sequence data. Conditional random fields offer several advantages over hid...
John D. Lafferty, Andrew McCallum, Fernando C. N. ...
CIE
2009
Springer
15 years 9 months ago
Numberings and Randomness
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Paul Brodhead, Bjørn Kjos-Hanssen
AINA
2007
IEEE
15 years 9 months ago
Random Oracle Instantiation in Distributed Protocols Using Trusted Platform Modules
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
Vandana Gunupudi, Stephen R. Tate
DAC
1996
ACM
15 years 7 months ago
Characterization and Parameterized Random Generation of Digital Circuits
The development of new Field-Programmed, MaskProgrammed and Laser-Programmed Gate Array architectures is hampered by the lack of realistic test circuits that exercise both the arc...
Michael D. Hutton, Jerry P. Grossman, Jonathan Ros...
FGR
2004
IEEE
200views Biometrics» more  FGR 2004»
15 years 6 months ago
Using Random Subspace to Combine Multiple Features for Face Recognition
LDA is a popular subspace based face recognition approach. However, it often suffers from the small sample size problem. When dealing with the high dimensional face data, the LDA ...
Xiaogang Wang, Xiaoou Tang