Sciweavers

3047 search results - page 389 / 610
» Aggregation functions: Means
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
15 years 7 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
ECML
2006
Springer
15 years 7 months ago
Cost-Sensitive Learning of SVM for Ranking
Abstract. In this paper, we propose a new method for learning to rank. `Ranking SVM' is a method for performing the task. It formulizes the problem as that of binary classific...
Jun Xu, Yunbo Cao, Hang Li, Yalou Huang
FLOPS
2006
Springer
15 years 7 months ago
iData for the World Wide Web - Programming Interconnected Web Forms
Abstract. In this paper we present the iData Toolkit. It allows programmers to create interactive, dynamic web applications with state on evel of abstraction. The key element of th...
Rinus Plasmeijer, Peter Achten
ELP
1991
15 years 7 months ago
Natural Semantics and Some of Its Meta-Theory in Elf
Operational semantics provide a simple, high-level and elegant means of specifying interpreters for programming languages. In natural semantics, a form of operational semantics, p...
Spiro Michaylov, Frank Pfenning
CAIP
2009
Springer
114views Image Analysis» more  CAIP 2009»
15 years 7 months ago
Decision Trees Using the Minimum Entropy-of-Error Principle
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
Joaquim Marques de Sá, João Gama, Ra...