1242 search results - page 154 / 249 » A Computational Complexity Theory in Membrane Computing |
100
click to vote
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
DCC
2006
IEEE
15 years 9 months ago
2006
IEEE
Optimal index assignment of multiple description lattice vector quantizer (MDLVQ) can be posed as a large-scale linear assignment problem. But is this expensive algorithmic approa...
MOBIHOC
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Scene recognition in an unconstrained setting is an open and challenging problem with wide applications. In this paper, we study the role of scene dynamics for improved representa...
ACIVS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Feature subset selection is an important subject when training classifiers in Machine Learning (ML) problems. Too many input features in a ML problem may lead to the so-...