1092 search results - page 187 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
123
Voted
ISSTA
2000
ACM
15 years 6 months ago
2000
ACM
During the past two decades many di erent pointer analysis algorithms have been published. Although some descriptions include measurements of the e ectiveness of the algorithm, qu...
121
Voted
COMPGEOM
2008
ACM
15 years 3 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
122
click to vote
AI
2008
Springer
15 years 2 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
213
Voted
COMPGEOM
2011
ACM
14 years 5 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...
109
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...