2969 search results - page 386 / 594 » A space efficient algorithm for group structure computation |
153
click to vote
AAAI
2006
15 years 6 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
126
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
250
click to vote
SIGMOD
2009
ACM
16 years 5 months ago
2009
ACM
The Web as a global information space is developing from a Web of documents to a Web of data. This development opens new ways for addressing complex information needs. Search is n...
152
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
168
Voted
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...