Sciweavers

1439 search results - page 115 / 288
» Bagging with Adaptive Costs
Sort
View
ECML
2006
Springer
13 years 11 months ago
Learning Stochastic Tree Edit Distance
Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured...
Marc Bernard, Amaury Habrard, Marc Sebban
MASCOTS
2004
13 years 9 months ago
Predicting When Not to Predict
File prefetching based on previous file access patterns has been shown to be an effective means of reducing file system latency by implicitly loading caches with files that are li...
Karl Brandt, Darrell D. E. Long, Ahmed Amer
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 8 months ago
Fast Algorithm and Implementation of Dissimilarity Self-Organizing Maps
In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a se...
Brieuc Conan-Guez, Fabrice Rossi, Aïcha El Go...
CORR
2000
Springer
84views Education» more  CORR 2000»
13 years 7 months ago
Robust Classification for Imprecise Environments
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
Foster J. Provost, Tom Fawcett
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...