594 search results - page 21 / 119 » Using Approximation to Relate Computational Classes over the... |
PODS
1994
ACM
14 years 22 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
IPSN
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The issue of data association arises frequently in sensor networks; whenever multiple sensors and sources are present, it may be necessary to determine which observations...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Many different relative clustering validity criteria exist that are very useful in practice as quantitative measures for evaluating the quality of data partitions, and new criter...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...