681 search results - page 84 / 137 » General Polynomial Time Decomposition Algorithms |
204
Voted
COMPGEOM
2011
ACM
14 years 4 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
106
Voted
AAAI
2011
14 years 13 days ago
2011
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
92
Voted
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
83
Voted
LCTRTS
2004
Springer
15 years 5 months ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...