1529 search results - page 178 / 306 » A slant removal algorithm |
CATS
1998
13 years 11 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
SMA
2010
ACM
13 years 10 months ago
2010
ACM
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
AI
2008
Springer
13 years 10 months ago
2008
Springer
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
CG
2008
Springer
13 years 10 months ago
2008
Springer
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resul...
IVC
2008
13 years 10 months ago
2008
Most illuminant estimation algorithms work with the assumption of one specific type of the light source (e.g. point light source or directional light source). This assumption brin...