Sciweavers

12148 search results - page 366 / 2430
» Generalized Bundle Methods
Sort
View
218
Voted
COLING
2010
15 years 2 months ago
Filtered Ranking for Bootstrapping in Event Extraction
Several researchers have proposed semi-supervised learning methods for adapting event extraction systems to new event types. This paper investigates two kinds of bootstrapping met...
Shasha Liao, Ralph Grishman
193
Voted
JMIV
2010
78views more  JMIV 2010»
15 years 2 months ago
Unified Computation of Strict Maximum Likelihood for Geometric Fitting
A new numerical scheme is presented for strictly computing maximum likelihood (ML) of geometric fitting problems. Intensively studied in the past are those methods that first tran...
Kenichi Kanatani, Yasuyuki Sugaya
268
Voted
TKDE
2012
270views Formal Methods» more  TKDE 2012»
13 years 10 months ago
Low-Rank Kernel Matrix Factorization for Large-Scale Evolutionary Clustering
—Traditional clustering techniques are inapplicable to problems where the relationships between data points evolve over time. Not only is it important for the clustering algorith...
Lijun Wang, Manjeet Rege, Ming Dong, Yongsheng Din...
165
Voted
ICML
2006
IEEE
16 years 8 months ago
Fast particle smoothing: if I had a million particles
We propose efficient particle smoothing methods for generalized state-spaces models. Particle smoothing is an expensive O(N2 ) algorithm, where N is the number of particles. We ov...
Mike Klaas, Mark Briers, Nando de Freitas, Arnaud ...
SACRYPT
2009
Springer
176views Cryptology» more  SACRYPT 2009»
16 years 2 months ago
Optimization Strategies for Hardware-Based Cofactorization
Abstract. We use the specific structure of the inputs to the cofactorization step in the general number field sieve (GNFS) in order to optimize the runtime for the cofactorizatio...
Daniel Loebenberger, Jens Putzka