Sciweavers

6568 search results - page 384 / 1314
» Reducing the Complexity of Reductions
Sort
View
ESANN
2006
15 years 9 months ago
Synthesis of maximum margin and multiview learning using unlabeled data
In this presentation we show the semi-supervised learning with two input sources can be transformed into a maximum margin problem to be similar to a binary SVM. Our formulation exp...
Sándor Szedmák, John Shawe-Taylor
ICIP
2007
IEEE
16 years 9 months ago
Content Adaptive Heterogeneous Snakes
Active contour (snake) approaches have been proved to be efficient tools to extract object boundary precisely. One drawback of these methods is that state-of-the-art snake algorit...
András Hajdu, Ioannis Pitas
DAC
2007
ACM
16 years 8 months ago
Fine-Grained Sleep Transistor Sizing Algorithm for Leakage Power Minimization
Power gating is one of the most effective ways to reduce leakage power. In this paper, we introduce a new relationship among Maximum Instantaneous Current, IR drops and sleep tran...
De-Shiuan Chiou, Da-Cheng Juan, Yu-Ting Chen, Shih...
ICML
2009
IEEE
16 years 8 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
ICML
1999
IEEE
16 years 8 months ago
AdaCost: Misclassification Cost-Sensitive Boosting
AdaCost, a variant of AdaBoost, is a misclassification cost-sensitive boosting method. It uses the cost of misclassifications to update the training distribution on successive boo...
Wei Fan, Salvatore J. Stolfo, Junxin Zhang, Philip...