Sciweavers

15073 search results - page 2653 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
166
Voted
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 7 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
144
Voted
AAAI
2012
13 years 7 months ago
Robust Cuts Over Time: Combatting the Spread of Invasive Species with Unreliable Biological Control
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
Gwen Spencer
CVPR
2008
IEEE
16 years 6 months ago
Order consistent change detection via fast statistical significance testing
Robustness to illumination variations is a key requirement for the problem of change detection which in turn is a fundamental building block for many visual surveillance applicati...
Maneesh Singh, Vasu Parameswaran, Visvanathan Rame...
146
Voted
CVPR
2008
IEEE
16 years 6 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
ICCV
2003
IEEE
16 years 6 months ago
Separating Reflection Components of Textured Surfaces using a Single Image
The presence of highlights, which in dielectric inhomogeneous objects are linear combination of specular and diffuse reflection components, is inevitable. A number of methods have...
Robby T. Tan, Katsushi Ikeuchi
« Prev « First page 2653 / 3015 Last » Next »