Sciweavers

80 search results - page 7 / 16
» Using Arc Weights to Improve Iterative Repair
Sort
View
ICASSP
2008
IEEE
15 years 4 months ago
Stereo matching with asymmetric occlusion handling in weighted least square framework
This paper presents a novel method for stereo matching with occlusion handling. In order to estimate optimal cost, we define an energy function and solve the iterative equation w...
Dong Bo Min, Kwanghoon Sohn
SODA
2000
ACM
96views Algorithms» more  SODA 2000»
14 years 11 months ago
Improved Steiner tree approximation in graphs
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
Gabriel Robins, Alexander Zelikovsky
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
15 years 10 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
SEMWEB
2010
Springer
14 years 7 months ago
One Size Does Not Fit All: Customizing Ontology Alignment Using User Feedback
Abstract. A key problem in ontology alignment is that different ontological features (e.g., lexical, structural or semantic) vary widely in their importance for different ontology ...
Songyun Duan, Achille Fokoue, Kavitha Srinivas
ICCAD
1994
IEEE
131views Hardware» more  ICCAD 1994»
15 years 1 months ago
Edge-map: optimal performance driven technology mapping for iterative LUT based FPGA designs
We consider the problem of performance driven lookup-table (LUT) based technology mapping for FPGAs using a general delay model. In the general delay model, each interconnection e...
Hannah Honghua Yang, D. F. Wong