Sciweavers

139 search results - page 6 / 28
» Fast perfect sampling from linear extensions
Sort
View
CIARP
2004
Springer
13 years 11 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
CVPR
2007
IEEE
14 years 2 months ago
Matrix-Structural Learning (MSL) of Cascaded Classifier from Enormous Training Set
Aiming at the problem when both positive and negative training set are enormous, this paper proposes a novel Matrix-Structural Learning (MSL) method, as an extension to Viola and ...
Shengye Yan, Shiguang Shan, Xilin Chen, Wen Gao, J...
SDM
2009
SIAM
138views Data Mining» more  SDM 2009»
14 years 5 months ago
ShatterPlots: Fast Tools for Mining Large Graphs.
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
MP
2008
117views more  MP 2008»
13 years 7 months ago
Stochastic programming approach to optimization under uncertainty
In this paper we discuss computational complexity and risk averse approaches to two and multistage stochastic programming problems. We argue that two stage (say linear) stochastic ...
Alexander Shapiro
ICIP
1998
IEEE
14 years 9 months ago
An Explicit Closed-Form Solution to the Limited-Angle Discrete Tomography Problem for Finite-Support Objects
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
Andrew E. Yagle