Sciweavers

1536 search results - page 304 / 308
» Approximately Dominating Representatives
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 6 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
PAMI
2010
190views more  PAMI 2010»
13 years 6 months ago
OBJCUT: Efficient Segmentation Using Top-Down and Bottom-Up Cues
—We present a probabilistic method for segmenting instances of a particular object category within an image. Our approach overcomes the deficiencies of previous segmentation tech...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
13 years 6 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
SIAMCO
2010
116views more  SIAMCO 2010»
13 years 6 months ago
Large-Population LQG Games Involving a Major Player: The Nash Certainty Equivalence Principle
We consider linear-quadratic-Gaussian (LQG) games with a major player and a large number of minor players. The major player has a significant influence on others. The minor playe...
Minyi Huang
TKDE
2010
148views more  TKDE 2010»
13 years 6 months ago
False Negative Problem of Counting Bloom Filter
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
Deke Guo, Yunhao Liu, Xiang-Yang Li, Panlong Yang