Sciweavers

5592 search results - page 1060 / 1119
» On Random Betweenness Constraints
Sort
View
ICML
2005
IEEE
14 years 10 months ago
Healing the relevance vector machine through augmentation
The Relevance Vector Machine (RVM) is a sparse approximate Bayesian kernel method. It provides full predictive distributions for test cases. However, the predictive uncertainties ...
Carl Edward Rasmussen, Joaquin Quiñonero Ca...
ICML
2004
IEEE
14 years 10 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
DCC
2009
IEEE
14 years 10 months ago
Compressed Kernel Perceptrons
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
Slobodan Vucetic, Vladimir Coric, Zhuang Wang
CHI
2009
ACM
14 years 10 months ago
Designable visual markers
Visual markers are graphic symbols designed to be easily recognised by machines. They are traditionally used to track goods, but there is increasing interest in their application ...
Enrico Costanza, Jeffrey Huang
CAV
2009
Springer
206views Hardware» more  CAV 2009»
14 years 10 months ago
D-Finder: A Tool for Compositional Deadlock Detection and Verification
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
Saddek Bensalem, Marius Bozga, Thanh-Hung Nguyen, ...
« Prev « First page 1060 / 1119 Last » Next »