Sciweavers

1983 search results - page 319 / 397
» Competitive graph searches
Sort
View
VLDB
2007
ACM
114views Database» more  VLDB 2007»
14 years 8 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
ATAL
2009
Springer
14 years 2 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
HT
2009
ACM
14 years 2 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
CRV
2008
IEEE
165views Robotics» more  CRV 2008»
14 years 2 months ago
Hierarchical Stereo with Thin Structures and Transparency
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
Mikhail Sizintsev
AINA
2007
IEEE
14 years 2 months ago
Un-biasing the Link Farm Effect in PageRank Computation
Link analysis is a critical component of current Internet search engines' results ranking software, which determines the ordering of query results returned to the user. The o...
Arnon Rungsawang, Komthorn Puntumapon, Bundit Mana...