Sciweavers

1510 search results - page 47 / 302
» Upper Probabilities and Additivity
Sort
View
ICDT
2011
ACM
232views Database» more  ICDT 2011»
13 years 2 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
ICPR
2004
IEEE
15 years 2 days ago
Resolution Enhancement by AdaBoost
This paper proposes a learning scheme based still image super-resolution reconstruction algorithm. Superresolution reconstruction is proposed as a binary classification problem an...
Bhaskar D. Rao, Junwen Wu, Mohan M. Trivedi
VTC
2008
IEEE
14 years 5 months ago
High Rate Two-Way Amplify-and-Forward Half-Duplex Relaying with OSTBC
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
Yang Han, See Ho Ting, Chin Keong Ho, Woon Hau Chi...
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 4 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
FC
1999
Springer
102views Cryptology» more  FC 1999»
14 years 3 months ago
Risk Management for E-Cash Systems with Partial Real-Time Audit
We analyze “coin-wallet” and “balance-wallet” under partial real-time audit, and compute upper bounds on theft due to the fact that not all the transactions are audited in ...
Yacov Yacobi