2186 search results - page 197 / 438 » Considering an Organization's Memory |
271
Voted
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, t...
285
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We investigate algorithms for evaluating moving window joins over pairs of unbounded streams. We introduce a unit-time-basis cost model to analyze the expected performance of thes...
171
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
We consider two-player games played for an infinite number of rounds, with -regular winning conditions. The games may be concurrent, in that the players choose their moves simulta...
143
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
142
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— One of the critical goals in code optimization for MPSoC architectures is to minimize the number of off-chip memory accesses. This is because such accesses can be extremely cos...