Sciweavers

844 search results - page 157 / 169
» More On Implicit Syntax
Sort
View
CVPR
2010
IEEE
14 years 12 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
AIPS
2010
14 years 11 months ago
When Policies Can Be Trusted: Analyzing a Criteria to Identify Optimal Policies in MDPs with Unknown Model Parameters
Computing a good policy in stochastic uncertain environments with unknown dynamics and reward model parameters is a challenging task. In a number of domains, ranging from space ro...
Emma Brunskill
APLAS
2008
ACM
14 years 11 months ago
Exception Handlers as Extensible Cases
Abstract. Exceptions are an indispensable part of modern programming languages. They are, however, handled poorly, especially by higherorder languages such as Standard ML and Haske...
Matthias Blume, Umut A. Acar, Wonseok Chae
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
CIKM
2008
Springer
14 years 11 months ago
The query-flow graph: model and applications
Query logs record the queries and the actions of the users of search engines, and as such they contain valuable information about the interests, the preferences, and the behavior ...
Paolo Boldi, Francesco Bonchi, Carlos Castillo, De...