2520 search results - page 372 / 504 » The complexity of approximating entropy |
141
click to vote
INFOCOM
1997
IEEE
15 years 8 months ago
1997
IEEE
A packet scheduler in a quality-of-service QoS network should be sophisticated enough to support stringent QoS constraints at high loads, but it must also have a simple implemen...
145
click to vote
EURODAC
1994
IEEE
15 years 8 months ago
1994
IEEE
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
145
click to vote
DBVIS
1993
15 years 8 months ago
1993
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
150
click to vote
SIGMOD
1994
ACM
15 years 8 months ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
126
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Approximating pairwise, or k-wise, independence with sublinear memory is of considerable importance in the data stream model. In the streaming model the joint distribution is give...