Sciweavers

588 search results - page 25 / 118
» Querying Objects Modeled by Arbitrary Probability Distributi...
Sort
View
122
Voted
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 7 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
172
Voted
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 10 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
170
Voted
PODS
1998
ACM
152views Database» more  PODS 1998»
15 years 8 months ago
A Cost Model for Similarity Queries in Metric Spaces
We consider the problem of estimating CPU (distance computations) and I/O costs for processing range and k-nearest neighbors queries over metric spaces. Unlike the specific case ...
Paolo Ciaccia, Marco Patella, Pavel Zezula
144
Voted
ICC
2008
IEEE
142views Communications» more  ICC 2008»
15 years 10 months ago
A Comprehensive Analytical Model for IEEE 802.11e QoS Differentiation Schemes under Unsaturated Traffic Loads
Arbitrary Inter-frame Space (AIFS), Contention Window (CW) and Transmission Opportunity (TXOP) are three important Quality-of-Service (QoS) differentiation schemes specified in the...
Jia Hu, Geyong Min, Michael E. Woodward, Weijia Ji...
154
Voted
AAAI
2012
13 years 6 months ago
An Object-Based Bayesian Framework for Top-Down Visual Attention
We introduce a new task-independent framework to model top-down overt visual attention based on graphical models for probabilistic inference and reasoning. We describe a Dynamic B...
Ali Borji, Dicky N. Sihite, Laurent Itti