Sciweavers

364 search results - page 38 / 73
» On the generalization of soft margin algorithms
Sort
View
IWMM
2007
Springer
122views Hardware» more  IWMM 2007»
14 years 2 months ago
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Numerous optimizations exist for improving the performance of nondeferred reference-counting (RC) garbage collection. Their designs are ad hoc, intended to exploit different count...
Pramod G. Joisha
ICCV
2009
IEEE
13 years 5 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
ICPR
2008
IEEE
14 years 2 months ago
Transductive optimal component analysis
We propose a new transductive learning algorithm for learning optimal linear representations that utilizes unlabeled data. We pose the problem of learning linear representations a...
Yuhua Zhu, Yiming Wu, Xiuwen Liu, Washington Mio
EACL
2009
ACL Anthology
14 years 8 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
ATAL
2009
Springer
14 years 2 months ago
Decentralised coordination of continuously valued control parameters using the max-sum algorithm
In this paper we address the problem of decentralised coordination for agents that must make coordinated decisions over continuously valued control parameters (as is required in m...
Ruben Stranders, Alessandro Farinelli, Alex Rogers...