2569 search results - page 85 / 514 » Approximate Objects and Approximate Theories |
147
click to vote
GIS
1999
ACM
15 years 10 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
191
click to vote
AIMSA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
170
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
151
click to vote
FOCS
2008
IEEE
16 years 23 days ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
156
click to vote
APPROX
2007
Springer
16 years 15 days ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...