Sciweavers

270 search results - page 49 / 54
» Incremental Dependency Parsing Using Online Learning
Sort
View
AAAI
2007
13 years 10 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
ICMCS
2006
IEEE
139views Multimedia» more  ICMCS 2006»
14 years 1 months ago
A Neural Network Based Adaptive Algorithm for Multimedia Quality Fairness in WLAN Environments
This paper investigates multimedia quality fairness in wireless LAN environments where channel are error-prone due to mobility and fading. The experimental results show that using...
Chiapin Wang, Tsungnan Lin
IJCV
2008
192views more  IJCV 2008»
13 years 7 months ago
Learning to Locate Informative Features for Visual Identification
Object identification (OID) is specialized recognition where the category is known (e.g. cars) and the algorithm recognizes an object's exact identity (e.g. Bob's BMW). ...
Andras Ferencz, Erik G. Learned-Miller, Jitendra M...
BMCBI
2008
149views more  BMCBI 2008»
13 years 7 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
COLT
2006
Springer
13 years 9 months ago
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
There are two main families of on-line algorithms depending on whether a relative entropy or a squared Euclidean distance is used as a regularizer. The difference between the two f...
Manfred K. Warmuth