18155 search results - page 3147 / 3631 » Point |
278
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
310
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
300
click to vote
ICDE
2002
IEEE
16 years 8 months ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...
268
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
184
click to vote
VIS
2006
IEEE
16 years 8 months ago
2006
IEEE
Current practice in particle visualization renders particle position data directly onto the screen as points or glyphs. Using a camera placed at a fixed position, particle motions...