963 search results - page 122 / 193 » On Computation of Performance Bounds of Optimal Index Assign... |
TKDE
2008
14 years 9 months ago
2008
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
65
Voted
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In this paper, we propose examining the participants in various meetings or communications within a social network, and using sequential inference based on these participant lists...
DAC
1997
ACM
15 years 2 months ago
1997
ACM
—Many application-specific architectures provide indirect addressing modes with auto-increment/decrement arithmetic. Since these architectures generally do not feature an indexe...
179
click to vote
CGF
2011
14 years 4 months ago
2011
This paper presents a parallel framework for simulating fluids with the Smoothed Particle Hydrodynamics (SPH) method. For low computational costs per simulation step, efficient ...
JPDC
2008
14 years 9 months ago
2008
This research investigates the problem of robust static resource allocation for distributed computing systems operating under imposed Quality of Service (QoS) constraints. Often, ...