1187 search results - page 171 / 238 » The Generalized Dimensionality Reduction Problem |
AIPS
1998
14 years 11 months ago
1998
Casting planning problems as propositional satis ability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the bene ts of this appro...
116
click to vote
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may...
TSP
2010
14 years 4 months ago
2010
A general deflation framework is described for the separation of a desired signal subspace of arbitrary dimensions from noisy multichannel observations. The method simultaneously u...
FSTTCS
2009
Springer
15 years 2 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
118
click to vote
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
This paper considers the problem of formal verification of MPI programs operating under a fixed test harness for safety properties without building verification models. In our app...