Sciweavers

1458 search results - page 253 / 292
» Monads for incremental computing
Sort
View
133
Voted
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 1 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
120
Voted
PVLDB
2010
174views more  PVLDB 2010»
15 years 1 months ago
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases
The RDF data model is gaining importance for applications in computational biology, knowledge sharing, and social communities. Recent work on RDF engines has focused on scalable p...
Thomas Neumann, Gerhard Weikum
142
Voted
QEST
2010
IEEE
15 years 1 months ago
Fortuna: Model Checking Priced Probabilistic Timed Automata
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...
Jasper Berendsen, David N. Jansen, Frits W. Vaandr...
180
Voted
ICMCS
2009
IEEE
97views Multimedia» more  ICMCS 2009»
15 years 1 months ago
Some new directions in graph-based semi-supervised learning
In this position paper, we first review the state-of-the-art in graph-based semi-supervised learning, and point out three limitations that are particularly relevant to multimedia ...
Xiaojin Zhu, Andrew B. Goldberg, Tushar Khot
152
Voted
ICIAR
2010
Springer
15 years 25 days ago
Image Segmentation for Robots: Fast Self-adapting Gaussian Mixture Model
Image segmentation is a critical low-level visual routine for robot perception. However, most image segmentation approaches are still too slow to allow real-time robot operation. I...
Nicola Greggio, Alexandre Bernardino, José ...