2286 search results - page 340 / 458 » Algorithms for Categorical Equivalence |
165
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
171
click to vote
WSCG
2004
15 years 8 months ago
2004
The parametrization of 3-d meshes can be used in many fields of computer graphics. Mesh-texturing, mesh-retriangulation or 3-d morphing are only few applications for which a mesh ...
137
click to vote
NIPS
2003
15 years 8 months ago
2003
Significant progress in clustering has been achieved by algorithms that are based on pairwise affinities between the datapoints. In particular, spectral clustering methods have ...
159
click to vote
NIPS
1998
15 years 7 months ago
1998
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
158
click to vote
ANNPR
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a framework for multiclass vehicle type (Make and Model) identification based on oriented contour points. A method to construct a model from several frontal ve...