Sciweavers

148 search results - page 28 / 30
» Formally Analyzing Expected Time Complexity of Algorithms Us...
Sort
View
DEBS
2008
ACM
13 years 8 months ago
Availability models for underlay aware overlay networks
Availability of an overlay network is a necessary condition for event delivery in event based systems. The availability of the overlay links depends on the underlying physical net...
Madhu Kumar SD, Umesh Bellur
SIGMOD
2005
ACM
77views Database» more  SIGMOD 2005»
14 years 7 months ago
On Joining and Caching Stochastic Streams
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
Jun Yang 0001, Junyi Xie, Yuguo Chen
COMPGEOM
2010
ACM
14 years 16 days ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
FOCM
2010
108views more  FOCM 2010»
13 years 6 months ago
Parallelization Method for a Continuous Property
Abstract. An automated method of general purpose is introduced for computing a rigorous estimate of a bounded region in Rn whose points satisfy a given property. The method is base...
Pawel Pilarczyk
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 7 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...