18306 search results - page 3061 / 3662 » Algorithmics in Exponential Time |
149
click to vote
CPM
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
176
Voted
CSR
2009
Springer
16 years 26 days ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
184
click to vote
DAGM
2009
Springer
16 years 26 days ago
2009
Springer
We present a novel algorithm for the markerless tracking of deforming surfaces such as faces. We acquire a sequence of 3D scans along with color images at 40Hz. The data is then re...
190
click to vote
ESWS
2009
Springer
16 years 26 days ago
2009
Springer
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
157
click to vote
GECCO
2009
Springer
16 years 26 days ago
2009
Springer
We present a probabilistic formulation of UCS (a sUpervised Classifier System). UCS is shown to be a special case of mixture of experts where the experts are learned independentl...