2137 search results - page 318 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
177
Voted
MM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of clustering Web image search results. Generally, the image search results returned by an image search engine contain multiple topics. Organizing the resu...
254
click to vote
VLDB
2003
ACM
16 years 5 months ago
2003
ACM
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
137
click to vote
HPDC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
128
click to vote
WSC
2008
15 years 7 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
166
Voted
JMLR
2010
15 years 3 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...