Sciweavers

4377 search results - page 355 / 876
» Mass problems and randomness
Sort
View
EMNLP
2010
15 years 4 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
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...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
WINE
2010
Springer
168views Economy» more  WINE 2010»
15 years 4 months ago
On the Competitive Ratio of Online Sampling Auctions
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
Elias Koutsoupias, George Pierrakos
ACL
2009
15 years 4 months ago
Efficient Inference of CRFs for Large-Scale Natural Language Data
This paper presents an efficient inference algorithm of conditional random fields (CRFs) for large-scale data. Our key idea is to decompose the output label state into an active s...
Minwoo Jeong, Chin-Yew Lin, Gary Geunbae Lee
TELSYS
2011
207views Education» more  TELSYS 2011»
15 years 1 months ago
GRASP: basic components and enhancements
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
Paola Festa, Mauricio G. C. Resende
TSP
2010
15 years 1 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...