Sciweavers

2223 search results - page 119 / 445
» Ontological Framework for Approximation
Sort
View
145
Voted
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 11 months ago
Truthful Mechanisms via Greedy Iterative Packing
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
Chandra Chekuri, Iftah Gamzu
TIP
1998
162views more  TIP 1998»
15 years 4 months ago
Variational image segmentation using boundary functions
Abstract—A general variational framework for image approximation and segmentation is introduced. By using a continuous “line-process” to represent edge boundaries, it is poss...
Gary A. Hewer, Charles S. Kenney, B. S. Manjunath
CIKM
2009
Springer
15 years 11 months ago
Using domain ontology for semantic web usage mining and next page prediction
This paper proposes the integration of semantic information drawn from a web application’s domain knowledge into all phases of the web usage mining process (preprocessing, patte...
Nizar R. Mabroukeh, Christie I. Ezeife
136
Voted
DEXAW
2005
IEEE
128views Database» more  DEXAW 2005»
15 years 10 months ago
An Ontology-Based Architecture for Service Discovery and Advice System
In this paper we present a novel, ontology-based approach to service discovery, which exploits domain knowledge and semantic service descriptions to guide the service discovery pr...
Devis Bianchini, Valeria De Antonellis, Michele Me...
JAIR
2010
108views more  JAIR 2010»
15 years 3 months ago
Kalman Temporal Differences
This paper deals with value (and Q-) function approximation in deterministic Markovian decision processes (MDPs). A general statistical framework based on the Kalman filtering pa...
Matthieu Geist, Olivier Pietquin