4894 search results - page 738 / 979 » The Guarding Problem - Complexity and Approximation |
ALT
2002
Springer
14 years 5 months ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
WWW
2010
ACM
14 years 3 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
We consider the problem of Time Difference of Arrival (TDOA) estimation for cyclostationary signals in additive white Gaussian noise. Classical approaches to the problem either ig...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...