Sciweavers

5785 search results - page 51 / 1157
» Approximability of Probability Distributions
Sort
View
COMPGEOM
2010
ACM
15 years 6 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
VLDB
2000
ACM
155views Database» more  VLDB 2000»
15 years 5 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
TPDS
2008
124views more  TPDS 2008»
15 years 1 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
CISS
2011
IEEE
14 years 5 months ago
Improving aggregated forecasts of probability
—The Coherent Approximation Principle (CAP) is a method for aggregating forecasts of probability from a group of judges by enforcing coherence with minimal adjustment. This paper...
Guanchun Wang, Sanjeev R. Kulkarni, H. Vincent Poo...
WIOPT
2011
IEEE
14 years 5 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...