Sciweavers

11565 search results - page 1967 / 2313
» Computing Minimal Mappings
Sort
View
NIPS
2007
15 years 8 months ago
Anytime Induction of Cost-sensitive Trees
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
Saher Esmeir, Shaul Markovitch
NIPS
2007
15 years 8 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
PDCN
2007
15 years 8 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III
SDM
2007
SIAM
171views Data Mining» more  SDM 2007»
15 years 8 months ago
A Better Alternative to Piecewise Linear Time Series Segmentation
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
Daniel Lemire
AAAI
2004
15 years 8 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
« Prev « First page 1967 / 2313 Last » Next »