Sciweavers

2754 search results - page 290 / 551
» Distributed Weighted Matching
Sort
View
115
Voted
AI
2009
Springer
15 years 10 months ago
Cost-Based Sampling of Individual Instances
In many practical domains, misclassification costs can differ greatly and may be represented by class ratios, however, most learning algorithms struggle with skewed class distrib...
William Klement, Peter A. Flach, Nathalie Japkowic...
113
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin
128
Voted
ICRA
2008
IEEE
143views Robotics» more  ICRA 2008»
15 years 9 months ago
Adaptive workspace biasing for sampling-based planners
Abstract— The widespread success of sampling-based planning algorithms stems from their ability to rapidly discover the connectivity of a configuration space. Past research has ...
Matthew Zucker, James Kuffner, James A. Bagnell
ICALP
2003
Springer
15 years 8 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
158
Voted
DIS
2008
Springer
15 years 5 months ago
Unsupervised Classifier Selection Based on Two-Sample Test
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
Timo Aho, Tapio Elomaa, Jussi Kujala