489 search results - page 62 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
AAAI
2010
13 years 9 months ago
2010
Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (appro...