4894 search results - page 790 / 979 » The Guarding Problem - Complexity and Approximation |
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We study a path planning problem which arises when multiple robots are used to gather data from stationary devices with wireless communication capabilities. Each device has a g...
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
PAISI
2009
Springer
14 years 2 months ago
2009
Springer
Discovering a representative set of theme patterns from a large amount of text for interpreting their meaning has always been concerned by researches of both data mining and inform...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
: © One-Class Collaborative Filtering Rong Pan, Yunhong Zhou, Bin Cao, Nathan N. Liu, Rajan Lukose, Martin Scholz, Qiang Yang HP Laboratories HPL-2008-133 collaborative filtering,...