10608 search results - page 271 / 2122 » Complexity of O'Hara's Algorithm |
120
Voted
ICIP
2003
IEEE
16 years 2 months ago
2003
IEEE
In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
104
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
103
click to vote
ECML
2005
Springer
15 years 6 months ago
2005
Springer
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
125
click to vote
CONTEXT
2003
Springer
15 years 5 months ago
2003
Springer
The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on ...
85
Voted
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...