Sciweavers

8437 search results - page 457 / 1688
» Preferences over Sets
Sort
View
ICML
2010
IEEE
15 years 8 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause
JDCTA
2010
151views more  JDCTA 2010»
15 years 1 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
EDBT
2009
ACM
136views Database» more  EDBT 2009»
16 years 1 months ago
On the comparison of microdata disclosure control algorithms
Privacy models such as k-anonymity and -diversity typically offer an aggregate or scalar notion of the privacy property that holds collectively on the entire anonymized data set....
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
ENC
2004
IEEE
15 years 10 months ago
Feature Selection for Visual Gesture Recognition Using Hidden Markov Models
Hidden Markov models have become the preferred technique for visual recognition of human gestures. However, the recognition rate depends on the set of visual features used, and al...
José Antonio Montero, Luis Enrique Sucar
ECAI
2008
Springer
15 years 8 months ago
Heuristics for Planning with Action Costs Revisited
We introduce a simple variation of the additive heuristic used in the HSP planner that combines the benefits of the original additive heuristic, namely its mathematical formulation...
Emil Keyder, Hector Geffner