Sciweavers

70 search results - page 8 / 14
» Boosting Based on a Smooth Margin
Sort
View
ICML
2007
IEEE
14 years 9 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
VMV
2001
93views Visualization» more  VMV 2001»
13 years 10 months ago
On-the-Fly Adaptive Subdivision Terrain
In this paper we present a method to achieve interactive rendering of smooth terrain based on coarse data. Therefore we use adaptive subdivision surfaces which are calculated on t...
Dirc Rose, Martin Kada, Thomas Ertl
SCALESPACE
2007
Springer
14 years 2 months ago
Uniform and Textured Regions Separation in Natural Images Towards MPM Adaptive Denoising
Abstract. Natural images consist of texture, structure and smooth regions and this makes the task of filtering challenging mainly when it aims at edge and texture preservation. In...
Noura Azzabou, Nikos Paragios, Frederic Guichard
VLSID
2009
IEEE
182views VLSI» more  VLSID 2009»
14 years 3 months ago
Fuzzy Logic Based Guidance to Graph Grammar Framework for Automated Analog Circuit Design
Abstract— This paper introduces a fuzzy logic based guidance architecture to a graph grammar framework for automated design of analog circuits. The grammar generates circuit topo...
Angan Das, Ranga Vemuri
ICML
2007
IEEE
14 years 9 months ago
On learning with dissimilarity functions
We study the problem of learning a classification task in which only a dissimilarity function of the objects is accessible. That is, data are not represented by feature vectors bu...
Liwei Wang, Cheng Yang, Jufu Feng