963 search results - page 77 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
ISSS
1996
IEEE
15 years 4 months ago
1996
IEEE
Traditionally, application specific computations have been focusing on numerically intensive data manipulation. Modern communications and DSP applications, such as WWW, interactiv...
103
click to vote
NIPS
2001
15 years 1 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
127
click to vote
DSN
2011
IEEE
13 years 11 months ago
2011
IEEE
—In this paper we extend the class of MAP queueing networks to include blocking models, which are useful to describe the performance of service instances which have a limited con...
120
click to vote
ISCI
2007
14 years 11 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
TCS
2010
14 years 6 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...