672 search results - page 71 / 135 » A General Solution to the Graph History Interaction Problem |
COMGEO
2006
ACM
13 years 8 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
SIGIR
2005
ACM
14 years 2 months ago
2005
ACM
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...
GECCO
2006
Springer
14 years 12 days ago
2006
Springer
Nadir point plays an important role in multi-objective optimization because of its importance in estimating the range of objective values corresponding to desired Pareto-optimal s...
ICVGIP
2004
13 years 10 months ago
2004
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
ESANN
2004
13 years 10 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...