60 search results - page 5 / 12 » escape 2007 |
AROBOTS
2005
13 years 9 months ago
2005
This paper deals with the surveillance problem of computing the motions of one or more robot observers in order to maintain visibility of one or several moving targets. The target...
CG
2007
Springer
13 years 9 months ago
2007
Springer
The Binet formula provides a mechanism for the Fibonacci numbers to be viewed as a function of a complex variable. The Binet formula may be generalized by using other bases and mu...
NIPS
2001
13 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
IJCAI
2003
13 years 11 months ago
2003
We extend multiclass SVM to multiple prototypes per class. For this framework, we give a compact constrained quadratic problem and we suggest an efficient algorithm for its optimi...
ESCAPE
2007
Springer
14 years 1 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...