Sciweavers

4110 search results - page 675 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
183
Voted
TIM
2010
144views Education» more  TIM 2010»
14 years 11 months ago
Extending Polynomial Chaos to Include Interval Analysis
Polynomial chaos theory (PCT) has been proven to be an efficient and effective way to represent and propagate uncertainty through system models and algorithms in general. In partic...
Antonello Monti, Ferdinanda Ponci, Marco Valtorta
CVPR
2004
IEEE
16 years 6 months ago
Feature Selection for Classifying High-Dimensional Numerical Data
Classifying high-dimensional numerical data is a very challenging problem. In high dimensional feature spaces, the performance of supervised learning methods suffer from the curse...
Yimin Wu, Aidong Zhang
ICCV
2007
IEEE
16 years 6 months ago
Embedded Profile Hidden Markov Models for Shape Analysis
An ideal shape model should be both invariant to global transformations and robust to local distortions. In this paper we present a new shape modeling framework that achieves both...
Rui Huang, Vladimir Pavlovic, Dimitris N. Metaxas
ICDE
2007
IEEE
143views Database» more  ICDE 2007»
16 years 6 months ago
Hiding in the Crowd: Privacy Preservation on Evolving Streams through Correlation Tracking
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
Feifei Li, Jimeng Sun, Spiros Papadimitriou, Georg...
224
Voted
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
16 years 6 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