Sciweavers

886 search results - page 141 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
SIROCCO
2004
13 years 9 months ago
Path Layout on Tree Networks: Bounds in Different Label Switching Models
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
Anat Bremler-Barr, Leah Epstein
ATAL
2007
Springer
14 years 1 months ago
Sharing experiences to learn user characteristics in dynamic environments with sparse data
This paper investigates the problem of estimating the value of probabilistic parameters needed for decision making in environments in which an agent, operating within a multi-agen...
David Sarne, Barbara J. Grosz
AIED
2005
Springer
14 years 1 months ago
Discovery of Patterns in Learner Actions
This paper describes an approach for analysis of computer-supported learning processes utilizing logfiles of learners’ actions. We provide help to researchers and teachers in ...
Andreas Harrer, Michael Vetter, Stefan Thür, ...
MIR
2004
ACM
236views Multimedia» more  MIR 2004»
14 years 1 months ago
Boosting contextual information in content-based image retrieval
We present a new framework for characterizing and retrieving objects in cluttered scenes. This CBIR system is based on a new representation describing every object taking into acc...
Jaume Amores, Nicu Sebe, Petia Radeva, Theo Gevers...
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...