2137 search results - page 251 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
178
click to vote
CIKM
2004
Springer
15 years 11 months ago
2004
Springer
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
190
click to vote
JAIR
2008
15 years 6 months ago
2008
Decision-theoretic planning is a popular approach to sequential decision making problems, because it treats uncertainty in sensing and acting in a principled way. In single-agent ...
149
click to vote
RECSYS
2009
ACM
16 years 25 days ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
166
click to vote
FOCS
2007
IEEE
16 years 20 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
171
click to vote
PODS
2002
ACM
16 years 6 months ago
2002
ACM
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...