Sciweavers

5022 search results - page 271 / 1005
» Data structures and problem solving using Java
Sort
View
119
Voted
EMNLP
2009
15 years 17 days ago
An Empirical Study of Semi-supervised Structured Conditional Models for Dependency Parsing
This paper describes an empirical study of high-performance dependency parsers based on a semi-supervised learning approach. We describe an extension of semisupervised structured ...
Jun Suzuki, Hideki Isozaki, Xavier Carreras, Micha...
103
Voted
IJCNN
2006
IEEE
15 years 8 months ago
Extraction of Components with Structured Variance
Abstract— We present a method for exploratory data analysis of large spatiotemporal data sets such as global longtime climate measurements, extending our previous work on semibli...
Alexander Ilin, Harri Valpola, Erkki Oja
136
Voted
ORL
2000
77views more  ORL 2000»
15 years 2 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos
419
Voted
CVPR
2012
IEEE
13 years 4 months ago
A Unified Framework for Event Summarization and Rare Event Detection
A novel approach for event summarization and rare event detection is proposed. Unlike conventional methods that deal with event summarization and rare event detection independently...
Junseok Kwon and Kyoung Mu Lee
130
Voted
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
15 years 4 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty