Sciweavers

672 search results - page 71 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
138
Voted
COMGEO
2006
ACM
15 years 18 days ago
Computing homotopic shortest paths efficiently
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...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
111
Voted
SIGIR
2005
ACM
15 years 6 months ago
Exploiting the hierarchical structure for link analysis
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...
Gui-Rong Xue, Qiang Yang, Hua-Jun Zeng, Yong Yu, Z...
GECCO
2006
Springer
144views Optimization» more  GECCO 2006»
15 years 4 months ago
Towards estimating nadir objective vector using evolutionary approaches
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...
Kalyanmoy Deb, Shamik Chaudhuri, Kaisa Miettinen
111
Voted
ICVGIP
2004
15 years 1 months ago
On Learning Shapes from Shades
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...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...
117
Voted
ESANN
2004
15 years 2 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
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...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...