Sciweavers

3991 search results - page 692 / 799
» Bounding homogeneous models
Sort
View
NIPS
2008
13 years 9 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
NIPS
2007
13 years 9 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
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
13 years 9 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
AIPS
2004
13 years 9 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf
DAGSTUHL
2006
13 years 9 months ago
An Algorithm for Matching Nondeterministic Services with Operating Guidelines
Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SO...
Peter Massuthe, Karsten Wolf