2446 search results - page 87 / 490 » Choiceless Polynomial Time |
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Zero-norm, defined as the number of non-zero elements in a vector, is an ideal quantity for feature selection. However, minimization of zero-norm is generally regarded as a combi...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
ICGI
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
WADS
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...