Sciweavers

3088 search results - page 404 / 618
» Online Passive-Aggressive Algorithms
Sort
View
CCCG
1993
15 years 7 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 6 months ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
PAMI
2008
146views more  PAMI 2008»
15 years 6 months ago
Optimal Randomized RANSAC
A randomized model verification strategy for RANSAC is presented. The proposed method finds, like RANSAC, a solution that is optimal with user-specified probability. The solution i...
Ondrej Chum, Jiri Matas
TNN
2008
138views more  TNN 2008»
15 years 6 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
JCP
2007
73views more  JCP 2007»
15 years 6 months ago
Investigating Shill Bidding Behaviour Involving Colluding Bidders
Abstract— Shill bidding is where spurious bids are introduced into an auction to drive up the final price for the seller, thereby defrauding legitimate bidders. Trevathan and Re...
Jarrod Trevathan, Wayne Read