1301 search results - page 95 / 261 » Bounded Version Vectors |
105
click to vote
ENTCS
2000
15 years 3 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
131
Voted
ISAAC
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
102
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
137
Voted
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract--In this paper, we (1) provide a complete framework for classification using Variational Mixture of Experts (VME); (2) derive the variational lower bound; and (3) apply th...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...