Sciweavers

701 search results - page 136 / 141
» Self Bounding Learning Algorithms
Sort
View
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 7 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
IJDMB
2010
216views more  IJDMB 2010»
13 years 6 months ago
Struct-NB: predicting protein-RNA binding sites using structural features
: We explore whether protein-RNA interfaces differ from non-interfaces in terms of their structural features and whether structural features vary according to the type of the bound...
Fadi Towfic, Cornelia Caragea, David C. Gemperline...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
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
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi