Sciweavers

10055 search results - page 1280 / 2011
» Structured programming using processes
Sort
View
JMLR
2006
190views more  JMLR 2006»
15 years 7 months ago
Causal Graph Based Decomposition of Factored MDPs
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
Anders Jonsson, Andrew G. Barto
ISCI
2007
170views more  ISCI 2007»
15 years 7 months ago
Automatic learning of cost functions for graph edit distance
Graph matching and graph edit distance have become important tools in structural pattern recognition. The graph edit distance concept allows us to measure the structural similarit...
Michel Neuhaus, Horst Bunke
URBAN
2008
83views more  URBAN 2008»
15 years 7 months ago
Automatic identification of urban settlement boundaries for multiple representation databases
Intuitive and meaningful interpretation of geographical phenomena requires their representation at multiple levels of detail. This is due to the scale dependent nature of their pr...
Omair Chaudhry, William A. Mackaness
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 9 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
SIGIR
2006
ACM
16 years 1 months ago
Type less, find more: fast autocompletion search with a succinct index
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
Holger Bast, Ingmar Weber
« Prev « First page 1280 / 2011 Last » Next »