Sciweavers

637 search results - page 28 / 128
» Filtering with Approximate Predicates
Sort
View
AAAI
2004
14 years 11 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
15 years 11 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ICPR
2004
IEEE
15 years 11 months ago
Switching Particle Filters for Efficient Real-time Visual Tracking
Particle filtering is an approach to Bayesian estimation of intractable posterior distributions from time series signals distributed by non-Gaussian noise. A couple of variant par...
Kenji Doya, Shin Ishii, Takashi Bando, Tomohiro Sh...
ICIP
2005
IEEE
15 years 3 months ago
Improving particle filter with support vector regression for efficient visual tracking
—Particle filter is a powerful visual tracking tool based on sequential Monte Carlo framework, and it needs large numbers of samples to properly approximate the posterior density...
Guangyu Zhu, Dawei Liang, Yang Liu, Qingming Huang...
JCST
2008
175views more  JCST 2008»
14 years 9 months ago
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...
Hong Shen, Yu Zhang