Sciweavers

2600 search results - page 290 / 520
» Clustering with or without the Approximation
Sort
View
ICASSP
2011
IEEE
14 years 9 months ago
An efficient rank-deficient computation of the Principle of Relevant Information
One of the main difficulties in computing information theoretic learning (ITL) estimators is the computational complexity that grows quadratically with data. Considerable amount ...
Luis Gonzalo Sánchez Giraldo, José C...
176
Voted
ICCV
2011
IEEE
14 years 6 months ago
Blurred Target Tracking by Blur-driven Tracker
Visual tracking plays an important role in many computer vision tasks. A common assumption in previous methods is that the video frames are blur free. In reality, motion blurs are...
Yi Wu, Haibin Ling, Jingyi Yu, Feng Li, Xue Mei, E...
171
Voted
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
13 years 8 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
185
Voted
JACM
2012
13 years 8 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
191
Voted
ICCV
2009
IEEE
16 years 11 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs