2430 search results - page 263 / 486 » Computing Tutte Polynomials |
140
click to vote
ICIP
2002
IEEE
16 years 5 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
129
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
We consider the segmentation of a trajectory into piecewise polynomial parts, or possibly other forms. Segmentation is typically formulated as an optimization problem which trades...
151
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
We study the problem of private classification using kernel methods. More specifically, we propose private protocols implementing the Kernel Adatron and Kernel Perceptron learning ...
127
click to vote
RECOMB
2001
Springer
16 years 4 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
155
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...